HLV-DS-SPEC-001 Implementation Freeze v0.1.0 freezes the deterministic executable implementation for the prospective Native 6D→3D Carrier Spectral and Dimensionless Resonance-Response Specificity Gate in the HLV carrier-state dark-sector programme. The controlling scientific protocol is: Krūger, M. (2026). HLV-DS-SPEC-001: Native 6D→3D Carrier Spectral and Dimensionless Resonance-Response Specificity Against Matched R/Q/W/IRR Nulls — Corrected Pre-Execution Protocol Freeze v0.1.1. Zenodo. DOI: 10.5281/zenodo.22160655. The original protocol v0.1.0, DOI 10.5281/zenodo.22160391, remains part of the immutable provenance record but is superseded by corrected protocol v0.1.1. This implementation freeze was completed before the first scientific DS-SPEC-001 target/control spectral evaluation. During implementation preparation, only synthetic graph tests, synthetic scorer and capacity tests, source-integrity checks, and the prospectively specified IRR golden-basis alignment were evaluated. No HLV target/control QSPEC signature, RRESP curve, target-control distance, family score, or DS-SPEC-001 scientific verdict was computed or inspected during preparation of this implementation freeze. The scientific target is the locked DG-001 finite carrier 1-skeleton, represented through the exact incidence-derived graph Laplacian L0 = B1 B1^T. All active eigenvalues are normalized by the upper spectral edge before evaluation. Therefore no absolute energy, length, time, eV/GeV mass scale, dark-photon mass, or Kaluza–Klein interpretation enters the computation. Two primary frozen signatures are implemented: 1. QSPEC — a 64-component empirical quantile representation of the active normalized graph spectrum. 2. RRESP — a 129-component dimensionless Lorentzian regularized spectral-response representation with fixed gamma = 1/64. RRESP is strictly a mathematical representation of a finite graph spectrum. It is not a measured physical frequency response, particle resonance, Kaluza–Klein tower, dark-photon spectrum, or compactification spectrum. The implementation generates four frozen null families with 31 accepted controls per family: R — exact degree-preserving abstract graph rewires; Q — matched random 6D→3D projection controls; W — matched altered-window cut-and-project controls; IRR — matched alternative-irrational 6D→3D cut-and-project hosts. The R family preserves the complete target vertex-degree sequence and graph connectedness exactly. Q and W use the byte-frozen DG-002 geometric-control implementation and corrected source rank-3-cell capacity-matching semantics. IRR uses the prospectively frozen alternative-irrational projector family together with a fixed, spectrum-independent basis alignment that reproduces the controlling golden projector basis at r = phi to numerical precision. A load-bearing feature firewall is implemented: the complete structurally accepted R/Q/W/IRR control bank is generated, canonicalized, stored as sparse incidence matrices, and SHA-256 hashed before any target or control QSPEC/RRESP calculation occurs. Consequently, spectral information cannot influence control acceptance, ordering, or replacement. For each family and each signature, the implementation applies the frozen confirmatory rules: - target distance must exceed the strict maximum leave-one-out control distance; - the frozen target-to-null margin must be at least 1.50; - at least two of three prospectively defined spectral sub-bands must separately exceed the corresponding maximum leave-one-out control distance. A family passes only if both QSPEC and RRESP pass. The overall HLV-DS-SPEC-001 PASS requires all four families — R, Q, W, and IRR — to pass. Eight load-bearing family/signature tests are therefore evaluated. The frozen machine verdict semantics distinguish complete PASS, complete absence of specificity, partial family/signature survival, and numerical/control-capacity inconclusiveness. Synthetic-only implementation validation passed before freezing. This included analytic graph-spectrum checks, independent QSPEC and RRESP formula checks, scorer validation, degree-preserving connected R rewiring, exact synthetic capacity matching, and IRR golden-basis alignment. These tests have status: TECHNICAL_IMPLEMENTATION_CHECK_ONLY__NOT_A_DSSPEC001_RESULT The package includes the deterministic scientific engine, vendored DG-002 control engine, corrected protocol package, locked DG-001 target archive, machine-readable frozen specifications, source provenance, SHA-256 manifests, technical validation report, and the exact One-Click Locked Colab notebook. The One-Click notebook requires no Google Drive mount and freezes the numerical environment and scientific execution path. The scientific run is permitted only after this exact implementation-freeze package has been publicly archived. A later PASS would establish only finite C2-level specificity of the frozen scale-quotiented graph spectrum and dimensionless regularized response against the declared R/Q/W/IRR null ensemble. It would not establish dark matter, physical extra dimensions, Kaluza–Klein states, dark photons, particles, an absolute mass or energy scale, a stress-energy tensor, electromagnetic invisibility, gravity, halo dynamics, cosmology, or observational validation. A later FAIL would reject only this geometry-only graph-spectral route as evidence for HLV-specific internal mode structure under the frozen null ensemble. Independently justified state, action, orientation, gauge, or continuum hypotheses would require separate prospective freezes. After public archival of this implementation freeze, the next permitted action is one unchanged execution of the exact frozen One-Click Colab on the target and R/Q/W/IRR controls, followed by preservation and publication of the locked scientific result regardless of outcome.
Marcel Krüger· Zenodo (CERN European Organi...· 0 citations
This record freezes corrected implementation v0.1.1 of the deterministic One-Click execution engine for HLV-DS-SPEC-001R. The controlling scientific recovery protocol remains unchanged: Krūger, M. (2026). HLV-DS-SPEC-001R: Prospective Recovery of the Native 6D-to-3D Carrier Spectral-Specificity Gate After Q-Control Capacity Stop — Pre-Execution Protocol Freeze v0.1.0. Zenodo. DOI 10.5281/zenodo.22162097. The purpose of implementation v0.1.1 is strictly technical: it removes a severe runtime bottleneck in the R-family continuity-replay stage of implementation v0.1.0 without changing the scientific hypothesis, target, null families, random seeds, spectral observables, thresholds, scoring rules, control-capacity rules, or machine-verdict logic. The identified bottleneck arose because implementation v0.1.0 performed two Python bidirectional graph-connectivity searches after essentially every accepted R-family double-edge swap. For the locked DG-001 target with N1 = 5345 edges, the frozen R procedure requires 50 × N1 = 267250 accepted swaps per replicate. Across 31 R replicates this corresponds to 8284750 accepted swaps and approximately 16.6 million Python reachability searches. This produced an implementation-level runtime stall in Google Colab before the scientific spectral evaluation was reached. Corrected implementation v0.1.1 replaces only this per-proposal connectivity-validation mechanism with a deterministic parent-certified replay. The corrected replay: - uses the identical PCG64 seed sequence; - consumes the same proposal stream; - preserves the same shared-endpoint, self-loop, and duplicate-edge rejection rules; - preserves the same accepted-swap target; - preserves the exact vertex-degree sequence; - performs an independent final connectivity check; - and, critically, requires the final sparse B1 matrix of every R replicate to be exactly equal to the corresponding already-public frozen parent R matrix. Any mismatch causes the recovery continuity gate to fail before any spectral calculation is allowed. During preparation of this corrected implementation, all 31 frozen R replicates were replayed and compared against the archived parent controls. Result: 31 / 31 exact sparse-matrix matches. This validation establishes implementation equivalence for the corrected R replay under the frozen parent controls. It is a technical implementation result only and is not a DS-SPEC-001R scientific result. No target QSPEC or RRESP spectral signature, target-control distance, family score, recovery verdict, or final carrier-specificity result was computed in preparing this corrected freeze. The complete scientific control bank remains frozen before spectral evaluation and retains the same load-bearing families: R — deterministic parent-continuity degree-preserving rewires; Q — capacity-matched random 6D-to-3D projection controls; W — capacity-matched altered-window controls; IRR — matched irrational-factor controls. The corrected implementation does not alter the Q recovery extension, Q candidate ceiling, W or IRR generation, accepted-control counts, spectral signatures, normalization, score construction, thresholds, or verdict logic. Visible flushed progress reporting has been added so that Colab now reports progress during R replay, Q-prefix reproduction, Q recovery extension, W and IRR generation, and the subsequent spectral evaluation. This reporting has no effect on scientific calculations. The implementation remains deterministic and self-contained. The One-Click notebook embeds the frozen upstream artifacts, reconstructs them with SHA-256 verification, requires no Google Drive mount, and preserves the lock-before-outcome execution order. Technical validation performed before this freeze includes exact replay of all 31 frozen R-family parent controls. No outcome-bearing target spectral calculation was inspected. Corrected implementation artifact identities: Corrected One-Click notebook SHA-256: 4b713ee16a754e4366952616e965186ad41fc54567971f3f560c3e5635126fae Corrected scientific engine SHA-256: e86a8f4f55bb8fd2ad99d0dd713ab109ac97bd6db6aac2ecabaa0de8409d8b0d Corrected implementation-freeze package SHA-256: 6cd34b01c5cd8f6ec51f3d6f2652656695ca0876c9edbb4a15f4564b4e28d42e This v0.1.1 record supersedes implementation v0.1.0 only with respect to the R-family runtime implementation and progress reporting. It does not supersede or modify the controlling DS-SPEC-001R scientific recovery protocol. After publication of this exact implementation freeze, the prescribed next action is to open the archived corrected One-Click notebook in Google Colab and execute Runtime → Run all once without editing any scientific cell, payload, seed, null-family rule, threshold, score, or verdict condition. The resulting locked scientific result archive and its printed SHA-256 must be preserved unchanged regardless of whether the final outcome is PASS, FAIL, or INCONCLUSIVE. A later PASS would support only the finite carrier spectral-specificity claim defined by the controlling frozen DS-SPEC-001R protocol and its declared null ensemble. It would not establish spacetime, gravity, Standard-Model recovery, particle masses, dark matter, dark energy, physical selection of the golden ratio, or experimental validation.
Marcel Krüger· Zenodo (CERN European Organi...· 0 citations
The Boundary Is the Locus Mathematics as a Contact Phenomenon, and the Sphere as Its Zero Driven by Dean A. Kulik September, 2026 Abstract The standard picture treats mathematics as a medium in which objects are situated and described. This paper inverts that picture. Mathematics does not fill space and does not reach into interiors. It occurs at boundaries, and only at boundaries, because a boundary is the only structure that supplies the distinctions any mathematical operation requires. The interior of a body is not poorly known — it is silent, in the precise sense that no coordinate, relation, or comparison is available there. The exterior is not a region with properties; it is the complement, defined only by reference to the boundary it lies outside of. Under this inversion the sphere occupies a distinguished position that is not aesthetic and not conventional. It is the unique body specified by a single scalar with no orientation datum, that scalar being measured from the interior outward. It is the unique zero of the isoperimetric deficit δ(K) = A³/(36πV²) − 1, which this paper identifies as the mathematical content of a shape. It has one boundary site where every polyhedron has many. And it is the unique convex body whose contact with any other convex body is generically zero-dimensional — the minimum possible aperture through which mathematics can enter. Three classical results carry the argument and none of them is novel: the Jordan–Brouwer separation theorem, which forces exactly two regions from any closed surface without any choice being made; the isoperimetric inequality, which makes the sphere the unique minimiser of boundary per volume; and the transitivity of SO(3) on the sphere, which removes every orientation datum. What is new is the reading. Each of these says the same thing once the inversion is applied: the sphere is the shape that admits the least mathematics, and departure from sphericity is exactly mathematical content. The consequences follow. Matter is a stabilised transformation boundary and its mathematics is emergent from that boundary rather than resident in any substance. Transformations are selected, not created: a shape's admissible transformations are a property of its boundary and exist whether or not any is taken. Calculation is downstream of transformation and requires distinctions transformation does not, so transformations occur that no mathematics can express. Every claim is graded, and the closing sections state what must follow next rather than what this paper declines to say. Contents 1. The inversion................................................................................................................................... 4 1.1 What the inversion forbids........................................................................................................... 4 2. The compilation order...................................................................................................................... 4 2.1 Nothing in the later sections exists at the origin............................................................................. 5 2.2 What the later quantities actually report....................................................................................... 5 2.3 The math-free condition.............................................................................................................. 5 2.4 The first event............................................................................................................................ 6 2.5 The corpus-wide question this fixes.............................................................................................. 6 3. The sphere: what a reader returns...................................................................................................... 6 3.1 The parameter count................................................................................................................... 6 3.2 The direction of the scalar............................................................................................................ 7 3.3 What is not available................................................................................................................... 7 4. Duality is forced, not chosen............................................................................................................. 7 4.1 The asymmetry is not a sign flip................................................................................................... 8 5. The interior is silent.......................................................................................................................... 8 5.1 Silent is not empty...................................................................................................................... 8 6. The exterior is nothing..................................................................................................................... 8 6.1 Why the outside cannot be measured from................................................................................... 9 7. Mathematics is a contact phenomenon.............................................................................................. 9 7.1 Contact rather than description.................................................................................................... 9 7.2 The consequence for scale........................................................................................................... 9 8. The measure: mathematical content as isoperimetric deficit.............................................................. 10 8.1 The ordering, computed............................................................................................................ 10 8.2 What the zero means................................................................................................................. 11 9. The discrete measure: aperture sites................................................................................................ 11 9.1 A face is an aperture, an edge is a sharper one.............................................................................. 11 10. Contact: the minimum nonzero aperture......................................................................................... 12 10.1 The two bounds meet.............................................................................................................. 12 11. The cost of a mark......................................................................................................................... 12 11.1 Antipodal marks cost nothing.................................................................................................... 13 12. Transformation precedes calculation.............................................................................................. 13 12.1 A transformation can exist without being representable.............................................................. 13 12.2 Mathematics grows toward what is already happening................................................................ 14 13. Shape selects the mathematics...................................................................................................... 14 13.1 The instance in a discrete substrate........................................................................................... 15 14. Matter is a stabilised transformation boundary................................................................................ 15 14.1 The wrench............................................................................................................................. 15 15. The dual existence........................................................................................................................ 15 15.1 Why the pair is asymmetric....................................................................................................... 16 16. Transformations are selected, not created...................................................................................... 16 16.1 The chain is a shape sequence, not a value sequence................................................................... 16 16.2 What this does to the question of origin..................................................................................... 17 17. The query space must remain open................................................................................................. 17 18. What must follow.......................................................................................................................... 17 19. Claim ledger................................................................................................................................. 18 20. Falsifiers...................................................................................................................................... 19 21. Summary..................................................................................................................................... 20 1. The inversion Mathematics is normally treated as ambient. Space is imagined as already coordinatised, objects are placed into it, and their properties are read off using machinery that was there before they arrived. Under that picture the interior of a body is as mathematically populated as anywhere else — it has coordinates, it has a metric, one can integrate over it — and the boundary is merely the place where one body's properties stop and another's begin. This paper takes the opposite position. Mathematics is not ambient and does not precede the objects. It occurs where things touch, and nowhere else. The claim is not that interiors are difficult to access. It is that an interior supplies nothing for a mathematical operation to act on. Every operation requires a distinction: a co
Dean Kulik· Zenodo (CERN European Organi...· 0 citations
{ "name": "session_break_continuation_with_vwap_anchor", "source": "Market profile / VWAP trading literature (e.g., Anna Coulling, John Carter)", "type": "entry_engine", "rule": "Enter long when price breaks above the first 30-minute opening range high, volume of breakout bar > 1.5x 20-bar average volume, and price is above session VWAP anchored at the daily open; enter short on mirror conditions below opening range low.", "pseudocode": "if bar == first 30min: set OH = high, OL = low; compute VWAP from daily open;\nif price > OH and volume > 1.5 * avg(volume,20):\n if close > VWAP: long = 1; stop = OL; take profit = 2 * (OH - OL) from entry;\nif price < OL and volume > 1.5 * avg(volume,20):\n if close < VWAP: short = 1; stop = OH; take profit = 2 * (OL - OH) from entry;\nexit at TP or SL or end of session.", "why_it_works": "Combines institutional volume confirmation with a key anchored reference level (VWAP) to validate trend continuation after early session direction." } Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Andrew Stewart Caldin· Zenodo (CERN European Organi...· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
The Yoneda lemma says that an object is completely determined by its relations to every other object. This paper asks about that word every: where does the separating power fall when the probe is weakened? And the loss turned out not to be governed by the strength of the probe. No new mathematical theorem and no new law is claimed. Scope of this paper (scope note): no new mathematical theorem and no new law is claimed. The Yoneda lemma, the existence of cospectral non-isomorphic graphs, and the coincidence of the character tables of the dihedral group of order eight and the quaternion group are all standard. No measured value is cited; every number is obtained by exhaustive enumeration. No category theory is developed; only the statement of the lemma is used, and neither its proof nor any generalisation is treated. Nothing is said about the complexity of graph isomorphism; this is an exhaustive count in the finite case of six vertices. No representation theory is developed; the character tables are quoted as known. It is not claimed that the Yoneda lemma justifies the method of this body of work; Section 6 exists precisely to stop that claim from being made. The relation to earlier papers. Paper 152 showed that two groups can share a character table without being isomorphic; this paper counts that phenomenon as a function of the strength of the probe. Paper 153 separated three stages of forgetting and exhibited evidence that a right adjoint is absent; this paper treats the neighbouring theorem on the same shelf. Paper 102 treated the question whether one can hear the shape of a drum; Section 3 is its finite version, counted exhaustively. Paper 163 showed that there exists and here it is are different sentences; Section 6 says that determined and computable are different sentences. The setting. Take a collection of objects and a probe, a function applied to an object that returns a value. When a probe returns the same value on two objects it does not separate them. The material is the simple graphs on six vertices, of which there are 32768 labelled ones. Three probes are used: the degree sequence, the spectrum of the adjacency matrix, and the spectrum together with the triangle count. For comparison the isomorphism type itself is included. First, the 32768 labelled graphs fall to 156 isomorphism classes, counted by applying all 720 vertex permutations and taking a canonical form. Second, the degree sequence is not enough. It takes only 102 distinct values and 84 classes survive unseparated in 30 groups. Third, the spectrum is not enough either. It takes 151 values and 10 classes survive in 5 groups. Fourth, this is the core. Adding the triangle count leaves the distinct values at 151 and the unseparated classes at 10. The triangle count is the trace of the cube of the adjacency matrix divided by six, a function of the spectrum, so adding it adds no information. Whether more probes separate more depends on whether the new one can be recovered from the old. Measure more invariants and you will eventually tell them apart is false; dependent invariants advance nothing. Fifth, strength is not a total order on separating power. The smallest pair the spectrum cannot separate has degree sequences zero one one one one four and zero zero two two two two, both with four edges and no triangles, sharing the spectrum minus two, zero, zero, zero, zero, two. The degree sequence does separate that pair. A weaker probe separates where a stronger one fails. Sixth, the same happens for groups. The dihedral group of order eight and the quaternion group share a character table and are not isomorphic. Counting the elements whose n-th power is the identity, that is the homomorphisms from a cyclic group, gives six and two at n equal to two, which separates them. The character table failed and counting maps from a single object succeeded. Yet at n equal to four the counts are eight and eight and do not separate. The same shape of probe changes its power when the test object changes, and which object works cannot be known in advance. That is why Yoneda demands every object. Seventh, this is a fence. The lemma reads as saying that a thing is determined by its relations, and the method of this body of work, writing what a thing separates rather than what it is, has a similar shape. Similarity is not justification. The Yoneda lemma is a theorem inside a category, about Hom sets and natural transformations, and a methodology is not such an object, so the lemma says nothing about it. Separate Yoneda as a theorem, where the Hom functor is fully faithful and the statement is proved, from Yoneda as a metaphor, where things are determined by relations and nothing is proved. Speaking the second with the authority of the first is the accident this body of work has spent its time avoiding. And determined does not mean computable: Yoneda says the object is determined and gives no way to find it. Closing. The Yoneda lemma demands every object, and replacing that word by a finite list loses something. What is lost is not governed by the strength of the probe: the degree sequence separated a pair the spectrum missed, and adding triangles gained nothing at all. The separator is whether the new probe can be recovered from the existing ones. Measure more and you will know is correct only when what is measured is independent. On the making of this work: The ideas and content of this work stem from the author's own considerations. Assistance from an AI (a large language model) was used for structuring, English translation, and checking the algebra. Any remaining errors or misinterpretations are solely the author's. Feedback and corrections are sincerely appreciated. ----- 米田の補題は、対象は他のすべての対象との関係で完全に決まると言う。本稿が問うのは、その「すべて」である——テストする相手を減らすと、どこで分離能が落ちるか。しかも落ち方は、プローブの強さでは決まらなかった。新しい数学定理も新しい法則も主張しない。 本稿の射程(射程注記):新しい数学定理も新しい法則も主張しない。米田の補題、同スペクトル非同型グラフの存在、二面体群と四元数群が同じ指標表を持つことは、いずれも標準的である。測定値を引かない——本稿の数はすべて全数え上げで得たものである。圏論を導入しない——米田の補題の主張だけを使い、証明も一般化も扱わない。グラフ同型判定の計算量を論じない——6頂点という有限の場合の全数え上げである。表現論を論じない——指標表を既知として引くだけである。米田の補題が本体系の方法を正当化するとは主張しない——むしろ本稿の第6節は、そう言いたくなることを止めるために書かれている。 既刊との関係。論文152 は「同じ指標表を持ちながら、同型でない」を示した——本稿はその現象を、プローブの強さの関数として数える。論文153 は忘却関手の三段を分け、右随伴が無いことの証拠を挙げた——本稿は同じ圏論の棚の、隣の定理を扱う。論文102 は「太鼓の形は聴き分けられるか」を扱った——本稿の第3節はその有限版の全数え上げである。論文163 は「在る」と「これだ」が別の文だと示した——第6節は「決まる」と「求まる」が別の文だと言う。 設定。対象の集まりと、そこから情報を引き出すプローブを考える。プローブとは、対象に当てて値を返す関数である。プローブが二つの対象に同じ値を返すとき、そのプローブは二つを分離できない。題材は 6 頂点の単純グラフで、ラベル付きで 32768 個ある。プローブは三つ用意する。次数列、隣接行列のスペクトル、そしてスペクトルと三角形の個数を組にしたもの。比較のために、同型類そのものを置く。 第一に、32768 個は同型類 156 に落ちる。720 通りの頂点の並べ替えをすべて当てて正規形を取り、数えた。 第二に、次数列では足りない。相異なる値は 102 しかなく、84 類が 30 の組の中で分離されずに残る。 第三に、スペクトルでも足りない。相異なる値は 151 で、10 類が 5 組で残る。 第四に、これが本稿の芯である。三角形の個数を足しても、相異なる値は 151 のまま、分離できない類は 10 のままであった。三角形の個数は隣接行列の三乗のトレースを 6 で割ったものであり、スペクトルの関数である。したがって足しても情報が増えない。プローブを増やしたときに分離能が上がるかどうかは、増やしたものが既存のプローブから復元できるかで決まる。「もっと多くの不変量を測れば、いつかは分かる」は正しくない——独立でない不変量をいくら足しても、一歩も進まない。 第五に、強さは分離能の全順序を与えない。スペクトルで分離できない最小の組を取り出すと、次数列が 0,1,1,1,1,4 のものと 0,0,2,2,2,2 のものであり、どちらも辺が 4 本、三角形が0 個で、共有しているスペクトルはマイナス 2、0、0、0、0、2 である。この二つは次数列では分離される。弱いプローブが分けて、強いプローブが分けない。 第六に、群でも同じことが起きる。二面体群 D4 と四元数群 Q8 は同じ指標表を持ち、同型でない。ところが n 乗して単位元になる元の個数、すなわち巡回群からの準同型の個数を数えると、n が 2 のとき 6 と 2 になり、二つを分ける。指標表は分けられなかったのに、たった一つの相手からの写像を数えるだけで分かれた。ところが n が 4 のときは 8 と 8 で、分けない。同じ形のプローブでも、相手を取り替えると分離能が変わる。どの相手が効くかは、あらかじめ分からない。だから米田は「すべての相手」を要求する。 第七に、これは柵である。米田の補題は「対象は、他との関係で決まる」と読める。本体系の方法——ものが何かではなく、何と何を分けるかで書く——と形が似ている。しかし似ていることは正当化ではない。米田の補題は圏の内部の定理であり、Hom 集合と自然変換という具体的な対象についての主張である。方法論はその対象ではないので、補題は方法論について何も言っていない。定理としての米田と、比喩としての米田を分ける。後者を前者の権威で語ることが、本体系がずっと避けてきた事故である。そして「決まる」は「求まる」を意味しない——米田は対象が決まると言うだけで、求め方を与えない。 結び。米田の補題が要求しているのは「すべての相手」である。その「すべて」を有限で置き換えると、落ちるものがある。しかも落ちるかどうかは、プローブの強さでは決まらない——次数列が分ける組をスペクトルが分けず、三角形を足しても一つも増えなかった。分離子は、そのプローブが既存のプローブから復元できるかである。「もっと測れば分かる」は、独立なものを測るときだけ正しい。 作成にあたって:本稿の着想と内容は、著者自身の考察に基づくものです。文章の構成整理や英訳、数式の確認には AI(大規模言語モデル)の助力を得ました。最終的な内容の解釈や誤りがあれば、それらはすべて著者の責に帰します。お気づきの点があれば、ご教示いただければ幸いです。
Yuuki Yamagishi· Zenodo (CERN European Organi...· 0 citations
The deflated-Welch statistic: a closed-form, guaranteed-level test for heteroscedastic one-way ANOVA William J. Dwyer, MD, MPH, FAAP — Department of Mathematics and Statistics, University of Massachusetts Lowell. ORCID 0009-0004-0855-7222. Concept DOI (always resolves to the latest version): 10.5281/zenodo.21908169. What this is The reproducibility deposit for the deflated-Welch statistic T_BB, a closed-form, guaranteed-level test for heteroscedastic one-way ANOVA (the Behrens–Fisher problem for k ≥ 3 groups). Welch's test becomes liberal under skew and unstable variance weights at small samples; T_BB = Q(s²)·exp(−R) keeps the ordinary group means and buys a guaranteed level by deflating the Welch quadratic by a Berger–Boos scale-inflation radius R. Three operating points are provided: a fixedcalibrated radius (κ_s), a design-adaptive near-guarantee radius (closed-form polygamma Cornish–Fisher with a finite-nkurtosis guard), and a fully proved smallest-eigenvalue radius R_eig (Gaussian, extended under bounded kurtosis). What the deposit contains Manuscript (author + anonymized) and a derivations supplement (DA1–DA13) plus a long-form derivations companion, covering: why Welch fails under skew in closed form; the Berger–Boos deflation and its exact worst-case radius; the polygamma-cumulant Cornish–Fisher radius with saddlepoint-exact normal backbone; the excess-kurtosis tail term with its finite-n upper-confidence guard; the imbalance correction; the fully proved smallest-eigenvalue radius (with the k-group multiplicity fix, free-β optimization, and the proved-under-bounded-kurtosis widening); and the k-sample Behrens–Fisher null distribution. Interactive demonstrator rerun_cochran/honest_anova.html — computes raw-mean Welch, the fixed / adaptive / proved T_BB radii, the estimand-changing transform routes, and the full routing receipt in the browser, reproducing the deposited Python. Its engine is extracted as a standalone Node module (m01A_anova_engine.js) and checked cell-by-cell against Python across an 84-design taxonomy (verify_anova_engine_taxonomy.py/.js, max |Δp| = 0.00000). Reproducibility scripts (rerun_cochran/, rerun/) — every reported number traces to a named, deterministically-seeded script (size/power/surface, the calibration and information-limit decompositions, the proved-radius verification, the imbalance calibration, the skew-router branch, and the figures). Real-data evidence — anova_flip_scan.py scans 2,783 public one-way layouts (254 datasets): guaranteed T_BBwithholds ~41% of Welch-significant calls, concentrated where the weight-instability screen fires, and never manufactures significance (Table 7 / Figure 15). Figures and the deterministic deposit builder (fixed timestamps → stable md5). All evaluation is simulation-based; the one empirical component is the public-dataset scan, which uses only openly distributed data. Code is released under the MIT License; text and figures under CC BY 4.0. Version history (consolidated changelog) Published version DOIs are marked ✅; the concept DOI above always resolves to the latest. Staged versions were rolled into the next published one unless noted. v1.0.74 (2026-08-29) — Proved-under-bounded-kurtosis radius (DA12.6). The proved non-normal widening now keys on excess kurtosis, √(1 + κ̂·(n−1)/(2n)), from the exact Var(s²/σ²) = 2/(n−1) + κ/n, so symmetric heavy tails (Student-t) are covered where the old skew form √(1 + 0.75·skew²) under-covered; tbbProved switched to the kurtosis form across the demonstrator, engine, and Python truth (re-verified JS-vs-Python at 0.00000); new rc_anova_kurtosis_proof.py + deep-dive. v1.0.73 ✅ 10.5281/zenodo.22165709 (2026-08-29) — Reconstructed & verified demonstrator engine (standalone Node module + taxonomy verifier, max |Δp| = 0.00000 across 84 designs; Yuen zero-variance fix; T_BB-routed presets both directions); series-impact deep-dive (the corrected R_eig k-group multiplicity gap also reaches m03 and m01t). v1.0.72 (2026-08-29) — Title set to "The deflated-Welch statistic…"; corrected + optimized proved radius R_eig (β/k multiplicity fix + β-optimization, DA12); real-data Welch-vs-T_BB flip scan (2,783 layouts; Table 7 / Figure 15) + demonstrator imbalance-factor fix; long-form derivations companion. v1.0.71 / v1.0.70 (2026-08-21) — Zhang normal-reference comparator benchmarked on the efficiency frontier (valid on only 24% of designs, in the calibrated-liberal cluster); k = 2 adaptive-radius case-study fold (design-scaling vs shape-keying distinction). v1.0.69 ✅ 10.5281/zenodo.22035826 (2026-08-20) — HTML R1/R2 presentation pass + Figure 9 adaptive per-cluster label merge. v1.0.68 ✅ 10.5281/zenodo.22033737 (2026-08-20) — Companion consolidation into a single six-column Table 6; Figures 11–14 harmonized into one story. v1.0.67 / v1.0.65 / v1.0.60 (2026-08-19/20) — Guarded-reference naming-collision fix; the 40,000-replication expanded-frontier pin (Table 3 + Figure 8) with the symmetric-heteroscedastic skew-router branch; the mean-preserving lightened-R_eig do-not-use fallback. v1.0.59 ✅ 10.5281/zenodo.21995320 (2026-08-18) — Reporting standard + honest_anova.html demonstrator re-aligned to the current T_BB methods paper. v1.0.57 ✅ 10.5281/zenodo.21986847 (2026-08-17) — Reviewer-comprehension pass (multi-paragraph abstract, contributions list, trimmed captions); proved radius R_eig added as a Table 3 scorecard row; corner tail-index correction (N−k)/2 (low-order moments exist in every deployed design). v1.0.56–v1.0.49 (2026-08-16) — The k-sample Behrens–Fisher corner-distribution program: two-moment scaled-χ² corner reference, derived corner cumulants, the secular-eigenvalue law + closed CGF + power-law tail, consolidated into derivations DA13 with a prior-art/novelty audit. v1.0.48 ✅ 10.5281/zenodo.21963458 (2026-08-16) — The unifying λ(z) correction (a smooth instability-keyed deflation strength). v1.0.45 ✅ 10.5281/zenodo.21962965 (2026-08-16) — Atomic sparsity index + bootstrap-t edge hardening + shape-aware pooled standardized-residual bootstrap (SA-PSRB); multivariate transfer to m03. v1.0.44–v1.0.41 (2026-08-16) — Shape-moment re-injection order (skew is the sweet spot), validated and hardened pooled standardized-residual bootstrap, atomic weight-noise probes. v1.0.40 ✅ 10.5281/zenodo.21961667 (2026-08-16) — Log-domain weight-stabilization probe (negative for stabilization; clarifies the size-adjusted oracle ceiling); includes the oracle-power gap decomposition (≈92% conservatism, ≈8% estimation). v1.0.37 ✅ 10.5281/zenodo.21961327 (2026-08-16) — Residual-bootstrap qualification of the shoot-out + the first proved Gaussian smallest-eigenvalue radius R_eig (DA12, the p = 1 specialization of the m03 theorem). v1.0.36 (2026-08-15) — Figure 11 T_BB-region colour fix (amber, matching the routing figures). v1.0.27 ✅ 10.5281/zenodo.21908170 — Earlier published baseline of the deposit. Provenance: every number traces to a named, deterministically-seeded script listed in the manuscript Declarations; the demonstrator engine reproduces the deposited Python to max |Δp| = 0.00000 across the taxonomy verification. License. Code and scripts in the deposit are released under the MIT License; text and figures under CC BY 4.0. Reuse is permitted with attribution to the author and citation of the concept DOI above. How to cite. Dwyer, W. J. The deflated-Welch statistic: a closed-form, guaranteed-level test for heteroscedastic one-way ANOVA. Reproducibility deposit, Zenodo. https://doi.org/10.5281/zenodo.21908169
William Dwyer· Zenodo (CERN European Organi...· 0 citations
This record contains the prospectively frozen scientific protocol for HLV-R-MECH-001, a mechanism-focused successor test motivated by the surviving degree-preserving rewire residual observed in earlier HLV specificity studies. HLV-R-MECH-001 is not a retry of full HLV carrier specificity. The previously published DS-SPEC-001R overall verdict remains permanently: DSSPEC001R_FAIL_PARTIAL_SIGNATURE_OR_FAMILY_ONLY The purpose of the present protocol is narrower: to test whether the previously observed R-family graph-spectral separation reproduces under fresh degree-preserving controls at matched structural perturbation depth, and whether that separation collapses when the exact target triangle count is additionally preserved. The protocol is motivated by an explicitly exposed exploratory result from HLV-R-MECH-DISC-001. For the DG-001 target: N0 = 1110 N1 = 5345 N2 = 6960 graph triangle count = 6960 The exploratory analysis verified that the complete set of 6960 graph triangles is exactly identical to the set of 6960 DG-001 two-cell face vertex-triples. By contrast, the earlier degree-preserving DS-SPEC R controls contained on average only approximately 285.74 triangles, corresponding to a mean retention of about 4.1% of the target triangle count. This exposed observation is not treated as confirmatory evidence. It is used only to define the new prospectively frozen mechanism question. The protocol defines two fresh control families. R_DEG: fresh degree-preserving rewires that preserve - the exact labelled target degree sequence; - N0 = 1110; - N1 = 5345; - graph simplicity; - connectivity; - and a frozen edge-replacement fraction between 0.40 and 0.45. The global triangle count is not constrained in R_DEG. R_TRI: fresh degree-preserving rewires that preserve all R_DEG constraints and additionally preserve the exact global triangle count T = 6960. Both families require 31 accepted controls. The two families are also required to have matched perturbation depth: the absolute difference between their median edge-replacement fractions may not exceed 0.02. If that condition fails, no spectral mechanism inference is permitted. The mathematical motivation is especially strong because for a simple graph with graph Laplacian L = D - A, the following exact identities hold: Tr(L) = sum_i d_i Tr(L^2) = sum_i d_i^2 + sum_i d_i Tr(L^3) = sum_i d_i^3 + 3 sum_i d_i^2 - 6T. Therefore degree preservation fixes the first two raw Laplacian moments, while simultaneous degree and exact triangle preservation also fixes the third raw Laplacian moment. Accordingly, every accepted R_TRI control matches the target in Tr(L), Tr(L^2), and Tr(L^3) exactly. This does not imply matching of the full spectrum, lambda_max, scale-quotiented eigenvalue distribution, QSPEC, or RRESP. The primary spectral observables are inherited unchanged from the published DS-SPEC-001R recovery protocol: Krūger, M. (2026). HLV-DS-SPEC-001R: Prospective Recovery of the Native 6D-to-3D Carrier Spectral-Specificity Gate After Q-Control Capacity Stop — Pre-Execution Protocol Freeze v0.1.0. Zenodo. DOI 10.5281/zenodo.22162097. The two frozen primary signatures are: QSPEC and RRESP. No new spectral feature is selected from the exposed R-MECH discovery result. For each family and signature, the target must satisfy all of the following to obtain a signature PASS: 1. target distance must exceed the maximum leave-one-out control distance; 2. the robust target-to-control margin must be at least 1.50; 3. at least two of the three prospectively frozen spectral bands must exceed the corresponding maximum leave-one-out band distance. A family PASS requires both QSPEC and RRESP to pass. The primary mechanism verdicts are frozen as follows. RMECH001_PASS_TRIANGLE_MATCH_COLLAPSE_PATTERN requires: R_DEG family PASS and R_TRI QSPEC FAIL and R_TRI RRESP FAIL. This result would support the conclusion that exact global triangle matching removes the previously observed robust R-family spectral separation under the frozen generator and perturbation-depth contract. It would not prove that triangle count alone is the unique causal invariant, because triangle preservation may simultaneously preserve correlated local structure. RMECH001_FAIL_TRIANGLE_SUFFICIENCY_RESIDUAL_SURVIVES requires: R_DEG family PASS and R_TRI family PASS. This result would show that degree sequence plus exact global triangle count are insufficient to eliminate the surviving R-family spectral residual. It would motivate stronger successor controls involving local triangle profiles, short cycles, graph motifs, or higher-order incidence structure. RMECH001_PARTIAL_SIGNATURE_DEPENDENCE_AFTER_TRIANGLE_MATCH is returned if R_DEG passes but exactly one of the two R_TRI signatures passes. If the fresh R_DEG family does not reproduce the previous degree-preserving separation, the result is: RMECH001_INCONCLUSIVE_FRESH_RDEG_BASELINE_NOT_REPRODUCED. Additional frozen inconclusive states cover insufficient control capacity, rewiring-depth mismatch, numerical audit failure, source mismatch, or protocol invalidation. The control-generation process is fully prospectively specified. R_DEG seeds are generated from: seed = 730100000 + offset for offsets 0 through 127. R_TRI seeds are generated from: seed = 730200000 + offset for offsets 0 through 127. Candidates are evaluated in increasing offset order, and the first 31 structurally admissible controls are accepted. If fewer than 31 controls are accepted in either family by offset 127, the run becomes inconclusive for control capacity. Previously exposed pilot and development seeds are permanently excluded from confirmatory use. A hard feature firewall is part of the protocol. No eigenvalue, lambda_max, QSPEC, RRESP, spectral band, target-control distance, leave-one-out score, or scientific mechanism verdict may be computed until both complete 31-member structural control banks have been: - generated; - structurally validated; - written to disk; - and hash-fixed. Control admission therefore cannot depend on spectral information. The protocol also freezes numerical identity and eigensolver checks, including trace identities, Frobenius consistency, connected-graph zero-mode checks, nonnegative-spectrum tolerance, and cross-solver eigenvalue audits on the target and selected controls. Secondary diagnostics are declared in advance but are non-load-bearing. These include: - triangle count and transitivity; - average clustering; - per-vertex triangle-count distribution; - four-cycle count; - degree assortativity; - k-core summaries; - Tr(L^4)/N; - lambda_2; - lambda_max. They may be inspected only after the structural control banks are frozen and may not alter the primary verdict. Controlling provenance: DG-001 locked results: DOI 10.5281/zenodo.22107618 DS-SPEC-001R recovery protocol: DOI 10.5281/zenodo.22162097 DS-SPEC-001R corrected implementation freeze: DOI 10.5281/zenodo.22164304 DS-SPEC-001R locked results: DOI 10.5281/zenodo.22165100 HLV Mathematical Core v2.1.4: DOI 10.5281/zenodo.22165745 The pre-freeze technical triangle-preserving pilot produced 12/12 structurally valid controls, each preserving the exact target degree sequence and exact triangle count T = 6960 while replacing approximately 41.3%–42.5% of target edges. No QSPEC, RRESP, spectral-specificity score, or scientific mechanism verdict was calculated during that pilot. The pilot is therefore treated strictly as technical feasibility evidence. HLV-R-MECH-001 does not test or establish: - unique HLV geometry; - physical selection of the golden ratio; - a unique 6D-to-3D microscopic substrate; - spacetime; - extra dimensions; - particle masses; - an absolute HLV energy scale; - gauge interactions; - gravity; - dark matter; - dark energy; - cosmology; - or experimental validation. The allowed scientific claim is narrower: HLV-R-MECH-001 prospectively tests whether the previously observed degree-preserving graph-spectral residual can be explained, removed, or further localized by exact matching of the target's global triangle/face count while controlling perturbation depth. Any stronger interpretation requires a separately frozen successor experiment.
Marcel Krüger· Zenodo (CERN European Organi...· 0 citations
IDEA: AUTO-FORWARDED from the Telegram/breakthrough stream (#719246, division=research, agent=gtx_scout): { "name": "session_break_continuation_with_vwap_anchor", "source": "Market profile / VWAP trading literature (e.g., Anna Coulling, John Carter)", "type": "entry_engine", "rule": "Enter long when price breaks above the first 30-minute opening range high, volume of breakout bar > 1.5x 20-bar average volume, and price is above session VWAP anchored at the daily open; enter short on mirror conditions below opening range low.", "pseudocode": "if bar == first 30min: set OH = high, OL = low; compute VWAP from daily open;\nif price > OH and volume > 1.5 * avg(volume,20):\n if close > VWAP: long = 1; stop = OL; take profit = 2 * (OH - OL) from entry;\nif price < OL and volume > 1.5 * avg(volum SAME-WINDOW EFFECT: Over the current trade window, this edge would have filtered out the two XAUUSD SHORT losses (both entered below the opening range low but likely without the required 1.5x Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Andrew Stewart Caldin· Zenodo (CERN European Organi...· 0 citations
The exponential expansion of satellite mega-constellations and orbital debris in Low Earth Orbit increases the operational risk of catastrophic collisions. Traditional centralized, ground-based Space Situational Awareness architectures depend on heavy numerical infrastructure, human-in-the-loop validation, and continuous communications, introducing structural latency and leaving spacecraft vulnerable during ground-link blackouts or delayed tracking updates.To resolve this vulnerability, we present STMEdge (Space Traffic Management, at the Edge), a high-performance, header-only, dependency-free C++ engine designed for real-time Conjunction Assessment Screening and emergency Collision Avoidance Maneuver sizing directly on spacecraft On-Board Computers. The software implements a deterministic pipeline consisting of a constant-work altitude filter, an epoch-normalized kinematic anti-tunneling sieve, a secular mean-element orbital propagator, an analytical golden section search for exact time-of-closest-approach refinement, a linearized state transition matrix accounting for atmospheric drag variability noise, a closed-form two-dimensional encounter plane collision probability evaluator, and a reactive impulsive in-track avoidance maneuver optimizer based on relative orbital dynamics. The system is engineered strictly as an on-board contingency triage engine for resource-constrained flight processors (such as ARM and RISC-V platforms on CubeSats and constellation buses). By eliminating dynamic heap allocations in the critical execution loop, STMEdge provides deterministic execution guarantees that allow autonomous spacecraft to continuously ingest local ephemeris catalogs, filter non-threatening encounters, assess collision risks, and compute emergency avoidance burns in communication-denied environments without ground intervention.
Andres Pirolo· Zenodo (CERN European Organi...· 0 citations
The Yoneda lemma says that an object is completely determined by its relations to every other object. This paper asks about that word every: where does the separating power fall when the probe is weakened? And the loss turned out not to be governed by the strength of the probe. No new mathematical theorem and no new law is claimed. Scope of this paper (scope note): no new mathematical theorem and no new law is claimed. The Yoneda lemma, the existence of cospectral non-isomorphic graphs, and the coincidence of the character tables of the dihedral group of order eight and the quaternion group are all standard. No measured value is cited; every number is obtained by exhaustive enumeration. No category theory is developed; only the statement of the lemma is used, and neither its proof nor any generalisation is treated. Nothing is said about the complexity of graph isomorphism; this is an exhaustive count in the finite case of six vertices. No representation theory is developed; the character tables are quoted as known. It is not claimed that the Yoneda lemma justifies the method of this body of work; Section 6 exists precisely to stop that claim from being made. The relation to earlier papers. Paper 152 showed that two groups can share a character table without being isomorphic; this paper counts that phenomenon as a function of the strength of the probe. Paper 153 separated three stages of forgetting and exhibited evidence that a right adjoint is absent; this paper treats the neighbouring theorem on the same shelf. Paper 102 treated the question whether one can hear the shape of a drum; Section 3 is its finite version, counted exhaustively. Paper 163 showed that there exists and here it is are different sentences; Section 6 says that determined and computable are different sentences. The setting. Take a collection of objects and a probe, a function applied to an object that returns a value. When a probe returns the same value on two objects it does not separate them. The material is the simple graphs on six vertices, of which there are 32768 labelled ones. Three probes are used: the degree sequence, the spectrum of the adjacency matrix, and the spectrum together with the triangle count. For comparison the isomorphism type itself is included. First, the 32768 labelled graphs fall to 156 isomorphism classes, counted by applying all 720 vertex permutations and taking a canonical form. Second, the degree sequence is not enough. It takes only 102 distinct values and 84 classes survive unseparated in 30 groups. Third, the spectrum is not enough either. It takes 151 values and 10 classes survive in 5 groups. Fourth, this is the core. Adding the triangle count leaves the distinct values at 151 and the unseparated classes at 10. The triangle count is the trace of the cube of the adjacency matrix divided by six, a function of the spectrum, so adding it adds no information. Whether more probes separate more depends on whether the new one can be recovered from the old. Measure more invariants and you will eventually tell them apart is false; dependent invariants advance nothing. Fifth, strength is not a total order on separating power. The smallest pair the spectrum cannot separate has degree sequences zero one one one one four and zero zero two two two two, both with four edges and no triangles, sharing the spectrum minus two, zero, zero, zero, zero, two. The degree sequence does separate that pair. A weaker probe separates where a stronger one fails. Sixth, the same happens for groups. The dihedral group of order eight and the quaternion group share a character table and are not isomorphic. Counting the elements whose n-th power is the identity, that is the homomorphisms from a cyclic group, gives six and two at n equal to two, which separates them. The character table failed and counting maps from a single object succeeded. Yet at n equal to four the counts are eight and eight and do not separate. The same shape of probe changes its power when the test object changes, and which object works cannot be known in advance. That is why Yoneda demands every object. Seventh, this is a fence. The lemma reads as saying that a thing is determined by its relations, and the method of this body of work, writing what a thing separates rather than what it is, has a similar shape. Similarity is not justification. The Yoneda lemma is a theorem inside a category, about Hom sets and natural transformations, and a methodology is not such an object, so the lemma says nothing about it. Separate Yoneda as a theorem, where the Hom functor is fully faithful and the statement is proved, from Yoneda as a metaphor, where things are determined by relations and nothing is proved. Speaking the second with the authority of the first is the accident this body of work has spent its time avoiding. And determined does not mean computable: Yoneda says the object is determined and gives no way to find it. Closing. The Yoneda lemma demands every object, and replacing that word by a finite list loses something. What is lost is not governed by the strength of the probe: the degree sequence separated a pair the spectrum missed, and adding triangles gained nothing at all. The separator is whether the new probe can be recovered from the existing ones. Measure more and you will know is correct only when what is measured is independent. On the making of this work: The ideas and content of this work stem from the author's own considerations. Assistance from an AI (a large language model) was used for structuring, English translation, and checking the algebra. Any remaining errors or misinterpretations are solely the author's. Feedback and corrections are sincerely appreciated. ----- 米田の補題は、対象は他のすべての対象との関係で完全に決まると言う。本稿が問うのは、その「すべて」である——テストする相手を減らすと、どこで分離能が落ちるか。しかも落ち方は、プローブの強さでは決まらなかった。新しい数学定理も新しい法則も主張しない。 本稿の射程(射程注記):新しい数学定理も新しい法則も主張しない。米田の補題、同スペクトル非同型グラフの存在、二面体群と四元数群が同じ指標表を持つことは、いずれも標準的である。測定値を引かない——本稿の数はすべて全数え上げで得たものである。圏論を導入しない——米田の補題の主張だけを使い、証明も一般化も扱わない。グラフ同型判定の計算量を論じない——6頂点という有限の場合の全数え上げである。表現論を論じない——指標表を既知として引くだけである。米田の補題が本体系の方法を正当化するとは主張しない——むしろ本稿の第6節は、そう言いたくなることを止めるために書かれている。 既刊との関係。論文152 は「同じ指標表を持ちながら、同型でない」を示した——本稿はその現象を、プローブの強さの関数として数える。論文153 は忘却関手の三段を分け、右随伴が無いことの証拠を挙げた——本稿は同じ圏論の棚の、隣の定理を扱う。論文102 は「太鼓の形は聴き分けられるか」を扱った——本稿の第3節はその有限版の全数え上げである。論文163 は「在る」と「これだ」が別の文だと示した——第6節は「決まる」と「求まる」が別の文だと言う。 設定。対象の集まりと、そこから情報を引き出すプローブを考える。プローブとは、対象に当てて値を返す関数である。プローブが二つの対象に同じ値を返すとき、そのプローブは二つを分離できない。題材は 6 頂点の単純グラフで、ラベル付きで 32768 個ある。プローブは三つ用意する。次数列、隣接行列のスペクトル、そしてスペクトルと三角形の個数を組にしたもの。比較のために、同型類そのものを置く。 第一に、32768 個は同型類 156 に落ちる。720 通りの頂点の並べ替えをすべて当てて正規形を取り、数えた。 第二に、次数列では足りない。相異なる値は 102 しかなく、84 類が 30 の組の中で分離されずに残る。 第三に、スペクトルでも足りない。相異なる値は 151 で、10 類が 5 組で残る。 第四に、これが本稿の芯である。三角形の個数を足しても、相異なる値は 151 のまま、分離できない類は 10 のままであった。三角形の個数は隣接行列の三乗のトレースを 6 で割ったものであり、スペクトルの関数である。したがって足しても情報が増えない。プローブを増やしたときに分離能が上がるかどうかは、増やしたものが既存のプローブから復元できるかで決まる。「もっと多くの不変量を測れば、いつかは分かる」は正しくない——独立でない不変量をいくら足しても、一歩も進まない。 第五に、強さは分離能の全順序を与えない。スペクトルで分離できない最小の組を取り出すと、次数列が 0,1,1,1,1,4 のものと 0,0,2,2,2,2 のものであり、どちらも辺が 4 本、三角形が0 個で、共有しているスペクトルはマイナス 2、0、0、0、0、2 である。この二つは次数列では分離される。弱いプローブが分けて、強いプローブが分けない。 第六に、群でも同じことが起きる。二面体群 D4 と四元数群 Q8 は同じ指標表を持ち、同型でない。ところが n 乗して単位元になる元の個数、すなわち巡回群からの準同型の個数を数えると、n が 2 のとき 6 と 2 になり、二つを分ける。指標表は分けられなかったのに、たった一つの相手からの写像を数えるだけで分かれた。ところが n が 4 のときは 8 と 8 で、分けない。同じ形のプローブでも、相手を取り替えると分離能が変わる。どの相手が効くかは、あらかじめ分からない。だから米田は「すべての相手」を要求する。 第七に、これは柵である。米田の補題は「対象は、他との関係で決まる」と読める。本体系の方法——ものが何かではなく、何と何を分けるかで書く——と形が似ている。しかし似ていることは正当化ではない。米田の補題は圏の内部の定理であり、Hom 集合と自然変換という具体的な対象についての主張である。方法論はその対象ではないので、補題は方法論について何も言っていない。定理としての米田と、比喩としての米田を分ける。後者を前者の権威で語ることが、本体系がずっと避けてきた事故である。そして「決まる」は「求まる」を意味しない——米田は対象が決まると言うだけで、求め方を与えない。 結び。米田の補題が要求しているのは「すべての相手」である。その「すべて」を有限で置き換えると、落ちるものがある。しかも落ちるかどうかは、プローブの強さでは決まらない——次数列が分ける組をスペクトルが分けず、三角形を足しても一つも増えなかった。分離子は、そのプローブが既存のプローブから復元できるかである。「もっと測れば分かる」は、独立なものを測るときだけ正しい。 作成にあたって:本稿の着想と内容は、著者自身の考察に基づくものです。文章の構成整理や英訳、数式の確認には AI(大規模言語モデル)の助力を得ました。最終的な内容の解釈や誤りがあれば、それらはすべて著者の責に帰します。お気づきの点があれば、ご教示いただければ幸いです。
Yuuki Yamagishi· Zenodo (CERN European Organi...· 0 citations
The Universal Aperture Transport System Topological Architecture, Hexadecimal Space, and the Computational Inversion of Matter Driven by Dean A. Kulik September 2026 1. The Compiling of Reality and the Table of Precedent In the prevailing paradigms of theoretical physics, information theory, and computational ontology, space is treated as an inert geometric container, mathematical law is viewed as an external descriptive tool, and physical matter is assumed to hold intrinsic values. A rigorous synthesis of discrete topology, contact Hamiltonian geometry, and recursive harmonic frameworks demands a total ontological inversion. The universe is not a container of objects that happen to possess surfaces. The universe is comprised of surfaces, and the interior object is a cognitive inference constructed from accumulated boundaries. The framework operates identically to compiled software. Reality must compile, and to compile it must follow a hierarchical table of precedent. Logic precedes transformation. Transformation generates shape. Shape dictates admissible mathematics. Mathematics resolves into phase-dependent values. Mathematics is not an intrinsic property of the void, nor a descriptive abstraction invented by observers. Mathematics is the emergent phenomenon of contact. It occurs at topological boundaries, identically to how friction occurs at physical boundaries, and it is the event of reality touching itself. The dual wave of this dual existence dictates that transformations always already exist. Wood is transformed into a table, the table provides lift, the lift changes spatial dimensions, and the chain of morphogenic evolution propagates without limit. These are not independent objects sequentially occupying a void. They are a singular transformation continuum in which matter is the halting condition of the topological fold. The ordering is strict, and it runs in one direction: LOGIC -> TRANSFORMATION -> SHAPE -> ADMISSIBLE MATHEMATICS -> VALUE The investigation runs the other way. A value is given; the work is to recover the formula that renders it, the relation the formula requires, the boundary that supplies the relation, and the transformation that produced the boundary. That reverse traversal is de-compilation, and it is the method of this report. 2. The Logic of Distinction: Spencer-Brown and the Unmarked State 2.1 The Foundational Mark The table of precedent begins below the level of mathematics, in the pure logic of distinction. In Laws of Form, George Spencer-Brown demonstrated that the root of all formal structure is the act of cleaving a space. The primary injunction is: draw a distinction. The mark separates a space into two states, generating an inside and an outside. Prior to the mark there is only the unmarked state, denoted here C0. C0 is not empty space, physical vacuum, or zero matter. C0 is absolute symmetry devoid of relational distinction. Within it there is no address system, no linear ordering, no distance, and no operator, because an address requires a distinguished reference and introducing one is already a transformation that breaks the symmetry. Distinction is the transcendental condition under which indication becomes possible; every system, however elaborate, rests on the residue of that first bifurcation. 2.2 Calling, Crossing, and Re-Entry Spencer-Brown's primary arithmetic establishes that a distinction persists unless an operation changes it, under two axioms. The Law of Calling: calling a state twice is indistinguishable from calling it once. The Law of Crossing: crossing a boundary twice restores the original state, which places an oscillatory behaviour at the foundation of logical space. This leads directly to re-entry, where a system is reintroduced into itself. Algebraically it is the self-referential form x = a + b/x, which unfolds into an infinite continued fraction. The imaginary unit is defined by the same move, i = −1/i, and it names a process alternating perpetually between states rather than a static value. The universe uses re-entry to sustain continuous transformation. Infinite objects do not exist; finite boundaries supporting processes that continue without limit do. 3. The Spherical Inversion: The Single Value Is Inside 3.1 The Geometry of C0 Interrogating the geometric form of C0 — the first structure capable of existing without importing an external distinction — yields the sphere. The sphere carries maximal symmetry, SO(3) acting transitively on its surface, and it is the only topology with zero privileged locations. Every point on an unmarked sphere is equivalent to every other, so the sphere supplies no information with which to distinguish a coordinate. The sphere is the only entity possessing exactly one formula and a single value, and that value exists exclusively on the inside. This is not a stylistic emphasis; it is forced. Jordan-Brouwer separation, requiring no mark, guarantees that a closed surface produces exactly two regions and that one of them is bounded. Bounded means finite extent. Finite extent means a scale exists on that side and nowhere else. That scale is r, and the closure measure C = 2πr relates it to the boundary's aggregate extent. Neither requires an origin on the surface and neither requires a direction, which is precisely why both are available before any mark is made. The outside is mathematically nothing. It is unbounded, it carries no intrinsic metric, and it cannot return a value. Everything sayable about it is a statement about the boundary phrased negatively. It follows that there is no matter there either: matter is the bounded region together with the boundary that closes it, and the exterior is where that matter is not. Matter is strictly shape, and all complex mathematics is an emergent property of that shape constraining the transformation field. 3.2 The Admissibility Filter This establishes the primary rule of the ontological compiler: shape is a strict constraint on mathematics. The sphere's perfect symmetry filters out addressable mathematics and leaves only the logic of continuation and closure. The demarcation is between mathematics forced by intrinsic topology and mathematics restricted until a mark is introduced. Shape Forced by intrinsic topology (M⁺) Requires a mark to compile (M⁻) Point coincidence, identity distance, integrals, gradients Line distance |x₂ − x₁|, one-dimensional integrals area, cross product, perpendicular Circle rotational closure θ + 2π ≡ θ canonical zero, linear order without a cut Sphere closure, r, C = 2πr, A = 4πR², κ = 1/R θ and φ, global chart, flat derivative ∂ₓ The distinction between the two columns is the machinery of the entire framework and it must not be collapsed. It is tempting to argue that C0 being math-free means the sphere has no r and no 2πr either. That argument destroys the table. The correct statement is narrower and stronger: the sphere refuses addressable mathematics, not all mathematics. It has no canonical origin, no global Cartesian chart, and no intrinsic angular coordinate — latitude and longitude necessarily fail at the poles, which is the shape physically demonstrating what it declines to supply. What it does have is one scale and one closure relation, and both are interior. 3.3 The Deficit as Measure The claim that the sphere admits the least mathematics has an exact quantitative form, and it is a classical theorem. The isoperimetric inequality states that for any body A³ ≥ 36πV², with equality if and only if the body is a sphere. Normalised as a deficit: delta(K) = A(K)^3 / (36 pi V(K)^2) - 1 >= 0, = 0 iff sphere Read conventionally this says the sphere is efficient. Read under the inversion it says the sphere is the unique zero of mathematical content, because boundary is where mathematics is and the sphere minimises boundary per unit of being. Departure from sphericity is mathematical content, exactly and computably. Body δ Sphere 0.000000 Regular icosahedron 0.206567 Regular dodecahedron 0.325034 Cylinder, h = 2r 0.500000 Regular octahedron 0.653987 Cube 0.909859 Cone, h = 2r 1.118034 Regular tetrahedron 2.307973 Torus, R = 3r 3.188790 Cylinder, h = 20r 4.145000 The Platonic solids order by descending face count, because fewer faces forces each to be larger and flatter and flatness is departure from the sphere. Elongation costs more than faceting. A discrete companion measure counts aperture sites: the sphere has one face, no edges and no vertices, giving a single site, where the cube has twenty-six and the icosahedron sixty-two. Euler's V − E + F = 2 holds across all of them, so the topological invariant is identical and the site count is not — two bodies of the same topology admit vastly different amounts of mathematics according to how their boundary has been divided. The same property produces both results. The sphere has no flat region, which minimises its boundary, and it is also why the sphere is the only convex body whose contact with any other convex body is generically a single point. Minimum boundary and minimum aperture are one property read at two scales. 4. Jordan-Brouwer Separation and Topological Bifurcation 4.1 Unprompted Bifurcation While an unmarked sphere refuses addressable coordinates, its existence as a closed manifold forces a physical reality into being with no mark required. The Jordan-Brouwer separation theorem, generalising the planar Jordan curve theorem, states that any topological (n−1)-sphere embedded in n-dimensional Euclidean space divides the complement into exactly two disjoint connected components — one bounded, one unbounded — with the surface as their single common boundary. For a sphere embedded in three-space this guarantees absolute bifurcation. It is a zero-mark compile eve
Dean Kulik· Zenodo (CERN European Organi...· 0 citations
Edge computing environments present unique challenges for neural network deployment due to resource constraints and latency requirements. This paper explores optimized deployment strategies for neural networks in edge computing scenarios, focusing on model compression techniques, adaptive allocation algorithms, and dynamic resource management. We propose a novel framework that combines quantization, pruning, and knowledge distillation to create lightweight models without significant accuracy loss. Experimental results demonstrate that our approach reduces model size by up to 70% while maintaining 95% of original accuracy. The framework also includes an adaptive scheduler that dynamically redistributes computational loads based on current network conditions and task priorities. Our evaluation across multiple edge devices shows an average latency reduction of 40% compared to traditional deployment methods. These findings contribute to more efficient and practical implementations of artificial intelligence in resource-constrained environments, enabling real-time applications in IoT, autonomous systems, and smart cities.
Zen Revista, 10 IA· Zenodo (CERN European Organi...· 0 citations
What if pathology foundation models could do more with less? GigaPath-Flash and GigaTIME-Flash cut computational demands while maintaining strong performance, opening the door to larger studies and broader exploration. The post GigaPath-Flash and GigaTIME-Flash: Toward population-scale discovery with efficient pathology foundation models appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduAug 31, 2026
With millions of users across the world, Julia has been used to conduct cutting-edge research and to design new drugs, jet engines, heat pumps, and more.
MIT News · Artificial Intelligence· news.mit.eduAug 27, 2026
A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.
