{"id":"802c9b8e-0b51-4b07-9ae7-7ad9f80e2f60","arxiv_id":"2601.17926","paper_version":2,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"low","formal_verification":"none","parameter_count":1,"one_line_summary":"For any pure quantum state, the entropy of a block is exactly minus half the sum of all inclusion-exclusion 'hyperlinks' crossing the block's boundary.","lead":"The paper introduces \"entanglement hyperlinks\" (generalized mutual informations) and proves that the entanglement entropy of any block of a pure state equals minus half the sum of hyperlinks crossing its boundary. This turns an earlier approximate link-based representation into an exact identity, built from the inclusion-exclusion principle.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: Eq. (20) is an exact Möbius-inversion identity requiring only purity; conjectural extensions are clearly labeled and non-essential.","rationale":"The reader's weakest_assumption focuses on the conjectural even-legged reconstruction and the continuity-based factorization conjectures. While these are indeed not rigorously proven, they are not load-bearing for the central claim, Eq. (20), which is an exact and elementary algebraic consequence of the EHL definition and pure-state symmetry. The paper is careful to label these extrapolations as conjectures and to state the limited numerical checks (up to N=9). Even if the even-legged reconstruction fails for larger systems, the exact edge reconstruction identity remains valid. Therefore no load-bearing concern about the central claim was identified. The only substantive issue is the symbol reuse between ELs and EHLs, which is a clarity defect, not a correctness defect. The verdict of ACCEPT should stand unchanged.","tokens_in":13235,"tokens_out":11947,"duration_ms":104140,"concrete_test":"As a sanity check, generate a random pure state with N=10, compute S_A for all A by exact diagonalization, compute J_I via Eq. (5), and verify S_A = -1/2 Σ_{I∈A:Ā} J_I for every A; a mismatch would indicate an algebraic error in the derivation, though none is expected.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim, Eq. (20), follows directly from the definition of EHLs (Eq. 5) via Möbius inversion (Eq. 18) and the pure-state conditions S_Ω=0 and S_A=S_Ā. It is an algebraic identity with no hidden approximation or additional assumption. The factorization theorem (Eq. 11) is also exact for product states, and its proof in Appendix A relies only on the standard additivity of entropies in tensor-product states. The conjectural parts of the paper—the even-legged reconstruction (Eq. B2) and the continuity-based factorization conjectures (Eqs. 13–14)—are explicitly labeled as conjectures and are not needed for the central theorem. A minor presentation issue is the reuse of the symbol J for both ELs (Eq. 2) and EHLs (Eq. 6) with a sign difference, but this does not affect correctness and is clarified by the formal definition in Eq. (5).","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces entanglement hyperlinks (EHLs), defined by inclusion-exclusion combinations of entanglement entropies over subsets of a multipartite pure state (Eq. 5). The main result is an exact 'edge reconstruction' identity (Eq. 20): the entropy of any block A equals -1/2 times the sum of all EHLs crossing the A-Ā boundary. This is derived from a 'bulk reconstruction' formula (Eq. 18) that is the Möbius inverse of the EHL definition, together with the purity conditions S_Ω=0 and S_A=S_Ā. The paper also proves a factorization theorem (EHLs crossing zero-entropy partitions vanish, Eq. 11), a coarse-graining theorem (Eq. 23), and presents numerical evidence for three conjectures: continuity of factorization (Eqs. 13-14), monogamy (Eq. 15), and an even-legged edge reconstruction with size-independent leg factors (Eq. B2).","tokens_in":13494,"tokens_out":15578,"duration_ms":145352,"significance":"The central claim, Eq. (20), is an exact algebraic identity requiring only purity and standard entropy additivity; it is a rigorous counterpart to the previously approximate link representation. The coarse-graining theorem (Eq. 23) is a clean and useful generalization. The paper is careful to label the even-legged reconstruction and the continuity-based factorization claims as conjectures, supported only by small-system numerics, so the reader can separate established results from speculative extensions. The derivations are parameter-free and the proof sketches in Appendix A are standard. If the conjectures are set aside, the paper provides a sound framework for expressing bipartite entanglement in terms of multipartite correlation measures; the main limitation is that the exact identities, while elegant, are essentially a reorganization of the definitions rather than an independent predictive scheme.","major_comments":[],"minor_comments":[{"comment":"The factorization theorem as stated in Eq. (10) (I(I1,I2)=0 ⇒ J_I=0) is not actually proven in Appendix A. The additivity argument there assumes S_A=0 and proves the corollary Eq. (11). Please add the short proof using S_A = S_{A∩I1} + S_{A∩I2} when the reduced state on I1∪I2 is product.","section":"Appendix A, Eq. (10)"},{"comment":"The coarse-graining theorem is demonstrated explicitly for K=2 and K=3, with the general case left as 'not hard to write.' Please provide a complete induction or a more formal statement that the general case follows by the same inclusion-exclusion decomposition.","section":"Appendix A, Eq. (23)"},{"comment":"The symbol J is used for both the approximate entanglement links (Eq. 2) and the EHLs (Eq. 5), with a sign difference. This is confusing; consider using a different symbol (e.g., L_{ij}) for the two-legged links.","section":"Notation, Eqs. (2)-(5)"},{"comment":"The caption mislabels the subfigures: three-legged EHLs appear in panels (b) and (c), not (c) and (d); four-legged EHLs appear in (d) and (e). Please correct.","section":"Figure 2 caption"},{"comment":"The notation for the average of S_A(ℓ) is inconsistent: the text refers to \\bar{S(ℓ)} but the equation shows S(ℓ) without a bar. Please clarify the definition of the correlation coefficient.","section":"Eq. (27)"},{"comment":"Minor typos: 'expessions' in Sec. IV; 'informations' in the abstract (should be 'information'); inconsistent spelling of 'Möbius'/'Moebius'. Also, Fig. 3 and Fig. 4 have no error bars for the random-chain data; adding error bars would strengthen the numerical support.","section":"Throughout"}],"recommendation":"minor_revision","confidential_remarks":"The central exact identity Eq. (20) is correct and the conjectural parts are clearly labeled, so the paper is sound. The main requested changes are local: fill in the missing proof of Eq. (10) and the general K proof of Eq. (23), fix the notation clash for J, and correct several typos. Once these are addressed, I would be happy to see the paper published."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: the central result is an exact rewriting of a definition, not a discovery, but it is correct and the paper is honest about what is proven and what is conjectured. The edge reconstruction identity, Eq. (20), follows directly from the EHL definition and pure-state symmetry; the algebra checks out. The factorization and coarse-graining theorems are simple corollaries, also fine. The genuinely new piece is the even-legged reconstruction conjecture, which is clearly labeled and supported only by small-system numerics up to N=9. If those leg-factors fail to exist or become N-dependent, the simplified reconstruction collapses, but the exact edge reconstruction remains valid.\n\nWhat the paper does well: it is transparent about the status of each claim. The proof sketches in Appendix A are standard and correct. The numerical sections are qualitative but are used only to support conjectures, not the central theorem. The connections to redundancy/synergy and holographic results are useful context. The citation pattern is fine; the self-citations reference the earlier link representation that this work genuinely extends.\n\nSoft spots: the EHLs are the well-known interaction information / I-measure with a sign convention, so the conceptual novelty is modest. The continuity argument behind the factorization conjectures (Eqs. 13-14) is a leap without a rigorous bound, but those are labeled conjectures. The even-legged reconstruction depends on leg-factors whose existence is plausible but unproven; checking to N=9 is thin evidence for a universal statement. Minor presentation gripe: the symbol J is used for both ELs and EHLs with a sign flip, which will confuse some readers.\n\nOverall, I agree with the reader's assessment. The paper deserves a serious referee; it is a tidy, useful conceptual contribution to multipartite entanglement. I'd cite it if I worked on entropy decompositions, and it would be a fine reading-group example of a mathematically clean but modest extension. Recommend peer review.","headline":"A clean, honest paper that recasts the familiar inclusion-exclusion interaction information as an exact 'edge reconstruction' of pure-state entropies; the central identity is correct, and the conjectures are clearly marked.","tokens_in":13940,"tokens_out":1897,"would_cite":true,"duration_ms":22726,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The entanglement entropy of any block of a pure state is exactly equal to minus one half the sum of all entanglement hyperlinks crossing its boundary.","keywords":["entanglement entropy","entanglement hyperlinks","inclusion-exclusion principle","mutual information","multipartite entanglement","pure states","monogamy","entanglement links"],"falsifier":"Take a generic pure state on ten sites, compute all EHLs from Eq. (5), and test whether Eq. (B2) with the leg-factors from Eq. (B5) reproduces every block entropy; any mismatch would disprove the even-legged reconstruction conjecture.","tokens_in":13158,"feed_emoji":"🔗","tokens_out":7624,"duration_ms":76789,"temperature":0.7,"pith_summary":"This paper aims to establish an exact, rather than approximate, representation of bipartite entanglement entropy in pure quantum states. It introduces entanglement hyperlinks (EHLs), generalized mutual informations defined through the inclusion–exclusion principle, and proves that the entropy of any block equals minus one half the sum of all hyperlinks crossing the boundary between the block and its complement. This turns the earlier approximate entanglement-link picture into a theorem. The paper also proves that a hyperlink crossing a factorized partition vanishes, and that coarse-grained hyperlinks are sums of fine-grained ones. For practical reconstruction, it conjectures—with numerical support only up to nine sites—that even-legged hyperlinks with universal prefactors suffice.","feed_headline":"Entanglement entropy is exactly a boundary sum of hyperlinks","feed_subtitle":"New identity makes the approximate link picture an exact theorem for pure states.","key_machinery":"The entanglement hyperlink J_I, defined for any subset I of sites by J_I = ∑_{B⊆I} (−1)^{|I|−|B|} S_B, is the paper's central object; it is a generalized mutual information whose sign signals redundancy or synergy. The proof machinery is Möbius inversion on the subset lattice: inverting Eq. (5) gives the bulk reconstruction S_A = ∑_{I⊆A} J_I, and combining it with the pure-state constraint S_Ω=0 yields the edge reconstruction S_A = −1/2 ∑_{I∈A:Ā} J_I (Eq. 20). The coarse-graining theorem (Eq. 23) expresses hyperlinks of coarse blocks as sums of the fine-grained hyperlinks that cross all boundaries, unifying the reconstruction. The conjectural even-legged reconstruction (Eq. B2) introduces le","core_discovery":"The central result is a closed, exact identity: for any pure state and any block A, the entanglement entropy S_A equals −1/2 times the sum of all entanglement hyperlinks J_I whose index set I contains sites on both sides of the boundary. Each hyperlink is defined by the inclusion–exclusion formula J_I = ∑_{B⊆I} (−1)^{|I|−|B|} S_B, so it measures multipartite correlations not reducible to lower-order terms. The identity follows from Möbius inversion of that expansion together with the pure-state symmetry S_A = S_Ā and the vanishing entropy of the whole system; it is exact, not an approximation. A companion coarse-graining theorem shows that a hyperlink joining coarse blocks equals the sum of","pith_inferences":["The exact boundary-sum identity suggests a direct route to area-law bounds: if one can bound the sum of crossing hyperlinks for a Hamiltonian ground state, one immediately bounds the entropy; the paper does not pursue this, but it is a natural next step.","The conjectured even-legged reduction implies that all odd-order inclusion–exclusion combinations (odd-legged hyperlinks) are determined by even ones, which would significantly constrain the space of pure-state entropy functions and sharpen the distinction between holographic and generic states.","One could test the factorization conjecture quantitatively by deriving a Lipschitz-type bound |J_Ω| ≤ C · S_min and checking whether the constant C is universal; the paper only gives a continuity heuristic.","The observed alternating sign pattern of high-rank hyperlinks in free-fermion chains suggests a possible extension of monogamy constraints to even/odd ranks, testable on holographic states where the entropy cone is known."],"forward_implications":["Every block of a pure state has its entanglement entropy computed exactly by summing boundary-crossing hyperlinks, upgrading the old approximate link representation to an equality.","Any hyperlink crossing a factorized bipartition vanishes, so hyperlinks can be used to detect and quantify how close a state is to a product across a given cut.","The coarse-graining theorem implies that exact reconstruction works for arbitrary partitions into blocks, not just single-site complements.","Numerical evidence on free-fermion ground states supports the factorization and monogamy conjectures: small minimal entropy entails small highest-rank hyperlink, and high block entropy correlates with low internal hyperlink magnitude.","If the even-legged reconstruction conjecture is correct, the number of independent entanglement quantities matches the 2^{N-1}-1 independent entropies of a pure state, and odd-legged hyperlinks become redundant."],"fun_headline_variants":["Entanglement entropy is an exact boundary sum of hyperlinks","Hyperlinks turn entanglement entropy into an exact identity","All pure-state entanglement entropy from boundary hyperlinks","Exact formula: entropy equals sum of crossing hyperlinks","Multipartite entanglement captured exactly by hyperlinks"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The exact boundary-sum identity is proven, but the paper's simplified even-legged reconstruction rests on the untested conjecture that prefactors Λ_{2l,p} exist and remain independent of system size; this has been verified only up to nine sites, and if it fails, the simplified reconstruction collapses.","fun_headline_variants_meta":{"raw":{"variants":["Entanglement entropy is an exact boundary sum of hyperlinks","Hyperlinks turn entanglement entropy into an exact identity","All pure-state entanglement entropy from boundary hyperlinks","Exact formula: entropy equals sum of crossing hyperlinks","Multipartite entanglement captured exactly by hyperlinks"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000133,"raw_usage":{"total_tokens":959,"prompt_tokens":720,"completion_tokens":239,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":464,"completion_tokens_details":{"reasoning_tokens":164}},"tokens_in":464,"tokens_out":239,"duration_ms":3377,"temperature":1.0,"reasoning_tokens":164,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-03T08:07:59.126762+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a generic pure state on ten sites, compute all EHLs from Eq. (5), and test whether Eq. (B2) with the leg-factors from Eq. (B5) reproduces every block entropy; any mismatch would disprove the even-legged reconstruction conjecture.","supporting_citations":[],"review_version":1}