{"id":"62b67f61-67ae-41e6-a7bb-40b7788c4830","arxiv_id":"2608.06755","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"For q=4 multi-entropy, every vertex link of the contraction graph has Euler characteristic n(3-n), so the graph encodes a smooth 3-manifold exactly at n=2 and develops conical singularities for all n≥3.","lead":"This paper classifies the topology of the four-colored contraction graph that pictures four-partite multi-entropy. It finds the graph builds a smooth three-manifold only for Rényi index n=2, and conical singularities with growing genus for every larger n.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: the vertex-link classification and the general-n argument are internally sound; the only caveats are the unproved but standard orientability of the links and the explicitly disclosed dependence on the conjectural GEM dictionary of Ref. [24].","rationale":"The reader's ACCEPT verdict is appropriate. The strongest claim—the complete classification of vertex links of Γ_{4,n} with χ=n(3−n) and the GEM condition holding only for n=2—is supported by a fully specified, parameter-free combinatorial argument. I checked the key reduction in Sec. 5.3 and found it rigorous: the invariant I for the dropped-D sector and the analogous coordinate invariants for the other dropped colors partition the graph into n residues of size 2n², each isomorphic to the standard q=3 family. The Euler characteristic computation is a direct application of the q=3 cell counts and is correct. The only genuinely load-bearing caveat is the physical interpretation, which depends on the proposed GEM dictionary of Ref. [24] and on the assumption that the genuine multi-entropy graph is captured by the S(q) contraction graph alone. This caveat is explicitly acknowledged in the paper and does not undermine the mathematical classification. The unproved orientability assertion is the closest thing to a gap, but it is standard (bipartite translation-invariant gluings give orientable surfaces), does not affect the GEM-condition or the χ values, and the reader already noted it. Hence no change to the verdict is warranted; a computational cross-check for n=4 would still be a prudent verification of the general formula beyond the hand-computed n=2 and n=3 cases.","tokens_in":18264,"tokens_out":23865,"duration_ms":223159,"concrete_test":"Independently enumerate the 3-residues of Γ_{4,4} by computer: build black/white vertices on Z_4^3, add A/B/C/D edges, drop each of the four colors in turn, and for each connected component compute F (graph vertices), E (remaining colored edges), and V (number of 2-colored subgraph components); verify F=32, E=48, V=12, χ=−4, and confirm orientability by checking that the dual graph of each component's triangulation is bipartite.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central combinatorial claim is correct. The proof of χ_link(n)=n(3−n) rests on the invariant I(x,ε)=x1+x2+x3+ε mod n for the D-drop residues, and on the analogous coordinate invariants for the A-, B-, and C-drop residues. In each case the residue splits into n components of size 2n², and each component is isomorphic as a colored graph to the standard q=3 multi-entropy graph Γ_{3,n}. The cell counts F=2n², E=3n², V=3n then give χ=3n−3n²+2n²=n(3−n). I verified the reduction for the drop-D sector and the coordinate relabeling for the other three color drops; both are consistent. The only auxiliary assumptions are (i) orientability of the vertex links, used to convert χ into the orientable genus g_n=(n−1)(n−2)/2, and (ii) the physical identification, adopted from Ref. [24], that the relevant graph for genuine multi-entropy is the S(q) contraction graph alone. Regarding (i), orientability follows from the translation-invariant, bipartite gluing of the q=3 residues; it is not proved in the text but is standard and does not affect the GEM-condition conclusion (only n=2 passes) or the positivity of the genus for n≥3. Regarding (ii), the paper states this premise openly, and the classification remains valid as combinatorics even if the physical dictionary were later revised. I therefore found no internal inconsistency or load-bearing mathematical gap in the paper's central claim.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper analyzes the four-colored contraction graph Γ_{4,n} of the standard q=4 multi-entropy permutation family under the graph-encoded manifold (GEM) dictionary proposed in Ref. [24]. For each of the four ways of deleting one color, it defines a mod-n invariant (I=x1+x2+x3+ε for the drop-D case, and analogous coordinate invariants for the other drops) and shows that the resulting three-colored subgraph splits into n connected components, each isomorphic as a colored graph to the standard q=3 multi-entropy graph Γ_{3,n}. Using the q=3 Euler count F=2n^2, E=3n^2, V=3n, the paper obtains χ_link(n)=n(3-n) for every vertex link. It concludes that Γ_{4,n} satisfies the GEM condition (all vertex links are two-spheres) if and only if n=2, while for every n≥3 the complex has 4n vertices whose links are closed orientable surfaces of genus (n−1)(n−2)/2, giving tori at n=3 and genus-three surfaces at n=4. The last section draws consequences for the proposed signal–TQFT dictionary, in particular for the n=4 toric-code result of Ref. [19], arguing that the relevant amplitude should involve Dirichlet boundaries rather than a closed-manifold partition function.","tokens_in":27,"tokens_out":17901,"duration_ms":244073,"significance":"The main theorem is a clean, parameter-free combinatorial classification: it reduces each vertex link of Γ_{4,n} to the well-understood q=3 family and derives the Euler characteristic uniformly in n. The proof is explicit and checkable: n=2 is identified with the octahedron Γ_{3,2} (spherical links), n=3 with the torus Γ_{3,3}, and the general argument in Sec. 5.3 is uniform. The conclusion that the GEM condition holds only for n=2 is robust because it does not depend on the orientability assumption for n≥3, where χ_link≠2; the orientability and connectivity needed for the genus formula are standard and true. As an application, the paper sharpens the interpretation of four-partite genuine multi-entropy in the toric code, where a closed-manifold TQFT reading is shown to be inappropriate for n=4. The physical interpretation is explicitly conditional on the conjectural GEM dictionary of Ref. [24] and on identifying the relevant graph with the S(q) contraction graph; the combinatorial classification stands independently of those premises.","major_comments":[],"minor_comments":[{"comment":"The conversion of χ_link(n)=n(3−n) into the orientable genus g_n=(n−1)(n−2)/2 assumes that every vertex link is connected and orientable. Connectivity follows from the explicit isomorphism with Γ_{3,n} (or from the fact that the translations e1,e2 generate Z_n^2), and orientability follows because the dual graph of each link triangulation is the three-colored subgraph, which is bipartite. Neither justification is stated; please add one or two sentences making both points.","section":"Sec. 5.3, Eq. (69)"},{"comment":"The general-n proof for dropping color A (and hence B or C by permutation) is compressed into a single sentence. For the same standard of rigor as the drop-D argument, spell out the invariant (x1 mod n for drop-A) and the induced edge rules ((B,C,D) acting as (e1,e2,id)), so that the claimed isomorphism with the q=3 family can be checked without re-derivation.","section":"Sec. 5.3, Step 3"},{"comment":"The introduction states that the n=2 standard family gives a smooth three-sphere, but the body verifies only the GEM condition (all vertex links are S^2) and does not identify the resulting 3-manifold. A short remark (e.g., that Γ_{4,2} is the dual graph of the 16-cell triangulation of S^3, or a reference to prior work) would make this assertion self-contained.","section":"Sec. 1 and Sec. 5.1"},{"comment":"The general formula χ=2n(n−1)(n−2) for the full four-colored complex is stated without derivation; only the n=3 value is computed. Since this quantity is used to illustrate the failure of the closed-manifold condition, a one-line derivation (or a pointer to where the general count is established) would be helpful.","section":"Sec. 5.2, Eq. (62)"}],"recommendation":"minor_revision","confidential_remarks":"This is a careful combinatorial note whose central computation is correct and transparently presented. The only caveats are the explicitly conditional physical dictionary and a few missing standard justifications (connectivity and orientability of the vertex links, and a more detailed treatment of the drop-A sector). I recommend minor revision rather than acceptance as-is mainly to make the general-n proof fully self-contained; I see no need for additional external review."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the main result is correct and clean. For the standard q=4 multi-entropy graph Γ_{4,n}, every vertex link has χ_link(n) = n(3−n); the GEM condition holds only at n=2, and at every n≥3 the graph carries 4n conical singularities with vertex links of genus (n−1)(n−2)/2.\n\nThe genuinely new step is the reduction of each vertex-link component to the standard q=3 graph Γ_{3,n}, via the invariant I(x,ε) = x1+x2+x3+ε (mod n). That reduction is explicit, and the general-n argument in Sec. 5.3 is sound. I checked the structure for the D-drop; by color symmetry the other drops follow. The paper verifies n=2 and n=3 in full detail, including cell counts, and the derivation of χ_link from the known q=3 Euler formula is legitimate. Credit where due: this is an honest, clearly written piece. It separates the GEM construction from the boundary replicated manifold, flags that the final TQFT interpretation depends on the conjectural dictionary of Ref. [24], and does not pretend to prove that dictionary.\n\nSoft spots are minor. The orientability of the links is asserted, not proved; it is standard for these translation-invariant bipartite gluings and irrelevant to the GEM-condition conclusion, so I do not count it against the paper. The physical reading depends on identifying the relevant graph with the S(q) contraction graph alone; the paper states this premise openly. If that dictionary is revised, the combinatorial classification stands on its own. One thing to note: the genuinely new content is the reduction, not the formula for χ, which was already known for q=3; but that is the right kind of novelty for a notes-style paper.\n\nWho this is for: anyone working on multi-entropy, GEMs, or the proposed signal–TQFT correspondence. It deserves a serious referee; the main claim is checkable and the paper is honest about its dependencies. I would accept it for review and lean toward acceptance after minor revisions.","headline":"Correct and clean combinatorial classification of q=4 multi-entropy vertex links; only n=2 gives smooth GEM, worth refereeing.","tokens_in":19169,"tokens_out":2255,"would_cite":true,"duration_ms":20142,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"For the four-partite multi-entropy graph, the GEM condition holds exactly at n=2.","keywords":["genuine multi-entropy","multi-entropy","graph-encoded manifold","colored contraction graph","vertex link topology","conical singularity","Euler characteristic","TQFT dictionary"],"falsifier":"Enumerate the vertex links of $\\Gamma_{4,3}$ directly by dropping one color: the paper predicts exactly three connected components per dropped color, each isomorphic to the $q=3,n=3$ graph with $V=9$, $E=27$, $F=18$ and $\\chi=0$. A direct enumeration that finds any spherical link, or a different component count, would disprove the classification.","tokens_in":18040,"feed_emoji":"🔺","tokens_out":11063,"duration_ms":97341,"temperature":0.7,"pith_summary":"The paper sets out to determine the geometric object encoded by the standard four-partite multi-entropy contraction graph when the graph is read as a triangulation by tetrahedra. Its main result is a complete classification of every vertex link: each has Euler characteristic $\\chi_{\\mathrm{link}}(n)=n(3-n)$, so the links are two-spheres exactly when the Rényi index is $n=2$ and closed surfaces of genus $\\tfrac12(n-1)(n-2)$ for every $n\\ge 3$. This decides when the graph satisfies the graph-encoded-manifold (GEM) condition and thus encodes a genuine closed three-manifold, and when it instead defines a simplicial complex with $4n$ conical singularities. The physical stake is whether genuine four-partite multi-entropy can be read as a TQFT partition function on a closed manifold or must be read as an amplitude on a manifold with boundary after the singularities are excised.","feed_headline":"Only n=2 gives a smooth manifold in the four-party multi-entropy graph","feed_subtitle":"At n≥3 its vertex links are tori or higher-genus surfaces, so the graph has conical singularities.","key_machinery":"The load-bearing object is the $q$-colored contraction graph $\\Gamma_{q,n}$: a bipartite, $q$-regular, edge-$q$-colored graph in which each vertex stands for a $(q-1)$-simplex and each edge of a fixed color stands for gluing along the corresponding codimension-one face. For $q=4$ the building blocks are tetrahedra, and the vertex link of a graph vertex is the closed surface obtained by dropping one color and taking connected components of the remaining three-colored subgraph. The paper's central reduction uses the invariant $I(x,\\epsilon)=x_1+x_2+x_3+\\epsilon \\pmod n$, preserved along the $A$-, $B$-, and $C$-colored edges, to split each drop-one-color subgraph into exactly $n$ sectors; each sector is isomorphic to the standard $q=3$ multi-entropy graph at the same $n$. Applying the $q=3$ cell counts $V=3n$, $E=3n^2$, $F=2n^2$ gives $\\chi_{\\mathrm{link}}(n)=n(3-n)$.","core_discovery":"The central claim is that for $q=4$ every vertex link of the standard multi-entropy graph $\\Gamma_{4,n}$ has $\\chi_{\\mathrm{link}}(n)=n(3-n)$. Since the links are connected and orientable, this means each is a two-sphere at $n=2$ and a closed orientable surface of genus $\\tfrac12(n-1)(n-2)$ for every $n\\ge3$; the graph satisfies the GEM condition if and only if $n=2$. For $n\\ge3$ the graph still defines a simplicial complex, but one with $4n$ conical singularities: a torus at $n=3$, a genus-three surface at $n=4$, and higher genus thereafter. The proof works by showing that each three-colored component obtained by dropping one color is isomorphic, as a colored graph, to the standard $q=3$ multi-entropy graph at the same replica index, so the known $q=3$ cell counts transfer directly.","pith_inferences":["Beyond the paper itself, the reduction to the $q=3$ graph is a combinatorial property of translation permutations, so the same invariant method could be applied to other multi-invariant permutation families to test whether their graphs satisfy the GEM condition at different Rényi indices.","If the proposed TQFT dictionary is right, the $n=2$ case is a concrete place to verify both sides by direct computation, while the $n=3$ and $n=4$ cases turn the Dirichlet-boundary prescription into a quantitative prediction about boundary topology.","The separation between the onset of singularities at $n=3$ and the onset of new four-partite information at $n=4$ suggests, one step beyond the paper, that failure of the GEM condition may be a necessary but not sufficient precursor to irreducible multipartite entanglement; checking this pattern in other $q$-partite families would test the geometric meaning of genuine signals."],"forward_implications":["At $n=2$ all eight vertex links of $\\Gamma_{4,2}$ are two-spheres, so the graph satisfies the GEM condition and encodes a smooth closed three-manifold, which the paper identifies as a three-sphere.","For every $n\\ge3$ the graph encodes a simplicial complex with exactly $4n$ conical singularities, whose link genus is $\\tfrac12(n-1)(n-2)$; the first cases are twelve torus singularities at $n=3$ and sixteen genus-three singularities at $n=4$.","The $q=4$, $n=4$ toric-code result of Ref. [19] is not a closed-manifold TQFT partition function; under the dictionary of Ref. [24] it belongs to a TQFT amplitude on the manifold with boundary obtained by excising the singularities, with sixteen genus-three boundary components.","The full complex has Euler characteristic $2n(n-1)(n-2)$, which vanishes only at $n=2$, independently marking the only candidate for a closed three-manifold.","The smooth closed-manifold case is isolated rather than generic: for infinitely many $n\\ge3$ the geometry is the singular Dirichlet-boundary type."],"supporting_citations":[{"why":"Supplies the GEM dictionary and the signal–TQFT conjecture that give the classification its physical reading.","marker":"[24]"},{"why":"Defines multi-entropy and the standard replica permutation family on Z_n^{q-1} from which Gamma_{q,n} is built.","marker":"[3]"},{"why":"Provides the q=3 replica-polygon construction and the Euler characteristic formula chi=n(3-n) used for each vertex link.","marker":"[25]"},{"why":"The toric-code four-partite genuine multi-entropy computation at n=4 whose interpretation the paper revises.","marker":"[19]"},{"why":"Gives the general replica-cycle Riemann–Hurwitz formula that reproduces the cell-counting Euler characteristic.","marker":"[2]"}],"fun_headline_variants":["Four-party multi-entropy graph smooth only at n=2","Γ(4,n) vertex links: spheres iff n=2, else higher genus","Conical singularities in four-party multi-entropy graph for n≥3","Only n=2 gives smooth graph-encoded manifold for four parties","Multi-entropy: vertex links become tori and higher-genus surfaces"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The classification itself is pure combinatorics, but its meaning for genuine multi-entropy depends on the proposed dictionary that reads graph vertices as simplices and colored edges as face gluings, and on the standard contraction graph being the right object for the signal.","fun_headline_variants_meta":{"raw":{"variants":["Four-party multi-entropy graph smooth only at n=2","Γ(4,n) vertex links: spheres iff n=2, else higher genus","Conical singularities in four-party multi-entropy graph for n≥3","Only n=2 gives smooth graph-encoded manifold for four parties","Multi-entropy: vertex links become tori and higher-genus surfaces"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001037,"raw_usage":{"total_tokens":4382,"prompt_tokens":984,"completion_tokens":3398,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":600,"completion_tokens_details":{"reasoning_tokens":3301}},"tokens_in":600,"tokens_out":3398,"duration_ms":24644,"temperature":1.0,"reasoning_tokens":3301,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T21:14:13.013329+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Enumerate the vertex links of $\\Gamma_{4,3}$ directly by dropping one color: the paper predicts exactly three connected components per dropped color, each isomorphic to the $q=3,n=3$ graph with $V=9$, $E=27$, $F=18$ and $\\chi=0$. A direct enumeration that finds any spherical link, or a different component count, would disprove the classification.","supporting_citations":[{"cited_title":"Genuine Multi-Entropy in the Toric Code","cited_arxiv_id":"2607.06050","evidence_quote":"The toric-code four-partite genuine multi-entropy computation at n=4 whose interpretation the paper revises."}],"review_version":1}