{"id":"9b5bed81-05b7-4512-a4e5-d76bb6183f7b","arxiv_id":"2412.15364","paper_version":3,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"Complete classification of SSA-compatible extreme rays of the six-party subadditivity cone, with 150 holographic graph realizations and 52 confirmed non-holographic orbits.","lead":"The paper computes all extreme rays of the six-party subadditivity cone that are compatible with strong subadditivity, finding 208 symmetry classes. It shows 150 can be realized by explicit holographic graph models, 52 violate known holographic inequalities, and 6 remain open.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The 208-orbit count depends on an unproven polyhedral extension: excluding next-to-maximal MI down-sets is justified by a quantum factorization argument, but the claim for arbitrary non-realizable KC-faces is only cited from [24].","rationale":"I agree with the reader that the cited results from [24] are the weakest load-bearing input. The paper is explicit and honest about relying on them; this is normal scholarly practice, and the Bell pairs theorem may well be correct. However, the next-to-maximal exclusion is used as a blanket reduction on all KC-faces, and the paper's only motivation in §2.2 uses quantum state factorization, which does not apply to non-realizable entropy vectors in R6_SSA. Since the ultimate object of study is a polyhedral cone and its SSA-compatible rays, the reduction must be a theorem about that cone. The proof is deferred to [24], and no independent check is reported here. A targeted face enumeration would settle the issue without redoing the full N=6 computation. The rest of the argument—the algorithm's internal completeness given the reductions, the explicit graph data, and the honest treatment of the six mystery orbits—appears sound or at least checkable. Therefore the reader's CONDITIONAL verdict is appropriate; I do not see a reason to move it.","tokens_in":87812,"tokens_out":17075,"duration_ms":132480,"concrete_test":"For N=6, take the face F_next = F* ∩ {I(123:456)=0} (and one representative of each other bipartition type, e.g., I(1:23456)=0 and I(12:3456)=0), where F* is defined by all single-party MI instances vanishing. Use Normaliz (or an equivalent polyhedral converter) to enumerate all extreme rays of this 41-dimensional face, filter the rays that satisfy every instance of strong subadditivity, and test whether any such ray is not a canonical lift from an N′≤5 extreme ray. If such a non-lift SSA-compatible ray exists, the next-to-maximal exclusion is invalid and the 208-orbit count is an undercount; if all such rays are lifts or violate SSA, the excluded-region reduction is validated for the critical case. This directly checks the unproven extension from [24, Sec. 3.4].","verdict_should_be":"UNCHANGED","load_bearing_attack":"The complete enumeration of R6_SSA is the central result, and the algorithm never examines down-sets containing maximal or next-to-maximal MI elements because they are placed in the initial excluded region U(0) (§2.2, §4). For maximal elements the lift argument is standard. For next-to-maximal elements I(J:K) with J∪K=[N], §2.2 argues that realization would force ρ_N=ρ_J⊗ρ_K and hence a sum of two entropy vectors, so the ray cannot be extreme. The paper then states that 'the result however can be extended to any KC-face, independently from realizability,' citing [24, Sec. 3.4], without proof. This extension is load-bearing because R6_SSA is defined as SSA-compatible extreme rays of the SAC, not as realizable quantum states; there may exist non-realizable SSA-compatible extreme rays saturating a next-to-maximal MI. If the cited polyhedral statement is false, such rays are excluded by U(0), the algorithm's output of 220 KC-orbits (and hence 208 SSA-orbits) would be incomplete, and every downstream classification (52 HEI-violating, 150 graph-realizable, 6 mystery) would be based on an incomplete set. The Bell pairs theorem from [24, Cor. 1] is similarly relied upon without re-proof, but the next-to-maximal exclusion is the sharper vulnerability because the paper's own heuristic justification is explicitly quantum-mechanical while the needed statement is purely polyhedral.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops a general algorithm for computing extreme rays of a polyhedral cone that correspond to down-sets in a poset of inequalities, and applies it to the six-party subadditivity cone. The main result is the enumeration of all SSA-compatible extreme rays of the SAC_6: 208 genuine six-party orbits, of which 52 violate at least one known holographic entropy inequality, 150 are realized by explicit holographic graph models, and 6 remain unclassified. The paper also reports that 12 KC-compatible orbits violate SSA, showing that KC is not exact at N=6, and it re-derives the known N=5 result as a benchmark. The algorithm is described in detail, with a completeness theorem, and the data and code are made available.","tokens_in":88098,"tokens_out":9082,"duration_ms":94610,"significance":"If the enumeration is correct, this is the first complete computation of R6_SSA and provides a concrete dataset for testing conjectures about the holographic entropy cone, the tree-graph conjecture, and the relation between Klein's condition and strong subadditivity. The algorithm itself is a useful contribution: it is framed generically, it is accompanied by a completeness proof, and it is benchmarked against known N=5 data. The paper is also commendable for making code and data publicly available and for clearly distinguishing proven statements from unresolved cases (the six mystery orbits and the two bulk-cycle graphs). The central claims are quantitative and falsifiable, and the presentation is generally careful. The main caveat is that the completeness of the enumeration relies on an unproven polyhedral extension statement from prior work; this is a dependence on a published theorem rather than a circular step, but it is load-bearing and should be made explicit.","major_comments":[{"comment":"The completeness of the enumeration depends on excluding all down-sets containing a next-to-maximal MI element, even for non-realizable KC-faces. The argument in §2.2 establishes this exclusion only for realizable faces, using the factorization ρ_N = ρ_J ⊗ ρ_{Jc}; the next sentence asserts that the result extends to any KC-face 'independently from realizability' and cites [24, Sec. 3.4] without giving the proof or the exact statement. Since R6_SSA is defined on the SAC without a realizability assumption, a non-realizable SSA-compatible extreme ray saturating a next-to-maximal MI would be excluded by U(0), invalidating the 208-orbit count and all downstream splits. Please include a self-contained proof of the polyhedral extension, or restate the precise theorem from [24] and explicitly incorporate it into the completeness argument.","section":"§2.2, Eqs. (2.13)–(2.15), and §4 initialization U(0)"},{"comment":"The actual computation of R6 uses the closure operator clLD (§3.4, §§4–5), while Theorem 2 is stated and proved for clFD. The paper states that the proof 'remains essentially unchanged' when clLD is used, but this replacement changes a triplet from a D-face to a D-subspace, changes the meaning of the 1-dimensional case, and affects the validity of discarding sets through the condition D_m ∩ U = ∅. Since the N=6 result was obtained with the clLD version, please provide a formal adapted completeness statement for clLD, including the post-processing verification that each 1-dimensional D-subspace contains a feasible extreme ray.","section":"§3.4 and §5"}],"minor_comments":[{"comment":"There is a typo: 'guaranties' should be 'guarantees'.","section":"§3.4"},{"comment":"The color-coding is essential to the classification but is not accessible in monochrome print or for visually impaired readers; please add explicit textual labels or a machine-readable key alongside the tables and in the supplementary data.","section":"Tables 4–8"},{"comment":"The graph construction procedure for the 150 realizations is described in two companion papers that are 'in preparation'; for archival reproducibility, please include the weighted adjacency lists and a verification script in the repository, or at least specify which files in the repository certify Table 8.","section":"§5.3 and Refs. [35,36]"},{"comment":"The representative vectors are not canonically ordered under party permutations (e.g., row 220 begins with {2,3,2,2,3,4}); this is not an error, but a brief note on how representatives were chosen would avoid confusion.","section":"Table 6"}],"recommendation":"major_revision","confidential_remarks":"The main uncertainty is not about the computational execution but about the unproven citation in §2.2: the next-to-maximal exclusion for arbitrary KC-faces is load-bearing for the completeness of the enumeration. The authors should be asked to supply the proof or an explicit theorem statement from [24], and to formalize the clLD adaptation of Theorem 2. If these are supplied, the paper is likely publishable."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The big news is that the N=6 SSA-compatible extreme-ray set is now nailed down to 208 orbits, with 52 HEI-violating, 150 graph-realized (25 of them new), and 6 honest open cases. The enumeration algorithm (down-set/closure-operator search) is a genuine new technique, the completeness proof in Theorem 2 is careful, and the N=5 recomputation plus public code/data give me reasonable confidence. This is real progress, not just a claim.\n\nThe main soft spot is the one the stress-test flags: the algorithm refuses to look at down-sets containing next-to-maximal mutual information elements, and the justification for that exclusion in arbitrary non-realizable KC-faces is cited from [24, Sec 3.4], not proven here. The paper's own motivating argument is quantum-mechanical; the needed statement is purely polyhedral. If that cited theorem were wrong, the 208 count could miss rays. I have no evidence it is wrong, and citing a published prior theorem is normal practice, but this is a load-bearing dependency and a referee should verify it. A short appendix re-proving or extracting that lemma would make the paper self-contained.\n\nThe other soft spots are minor. The graph-realization step for the 150 orbits leans on an unpublished companion paper, so the 'holographic' classification is partly by construction given in Table 8 plus a deferred method. That is acceptable for now, but it means the 150 number is not independently reproducible without that companion. The six mystery orbits and the two bulk-cycle graphs are handled honestly; the tree conjecture remains open, as advertised. Reproducibility is good but not turnkey: data and code exist, but there is no one-command pipeline.\n\nOverall: the enumeration is the main result and it looks solid. The completeness of the algorithm is proven; the input restrictions are the only real assumptions. This paper deserves a serious referee and is likely to be a standard reference for the N=6 SSA-cone. I would bring it to our group meeting and cite it if I were working on entropy cones.","headline":"The N=6 SSA-compatible extreme-ray enumeration is a real milestone; the main caveat is that the 208-orbit count inherits a polyhedral exclusion from [24] that this paper cites but does not re-prove.","tokens_in":88656,"tokens_out":2878,"would_cite":true,"duration_ms":26459,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P45","52B55","06A07"],"pacs":["03.67.-a"],"model":"deepseek-v4-flash","headline":"This paper computes the complete set of extreme rays of the six-party subadditivity cone compatible with strong subadditivity: 208 orbits, of which 150 are holographic, 52 are not, and 6 remain undecided.","keywords":["subadditivity cone","strong subadditivity","extreme rays","holographic entropy cone","holographic graph models","mutual information poset","Klein's condition","quantum marginal independence"],"falsifier":"Run an independent extreme-ray computation on the cone cut out by all six-party subadditivity instances together with all strong-subadditivity instances, reduced to the face $F^*$ where all single-party mutual informations vanish, and compare with the 208 listed orbits: any extreme ray outside the party-permutation orbits, or any listed ray that fails a direct strong-subadditivity check, refutes the enumeration. The tree question is settled by either constructing a fine-grained tree model for orbits #111 and #207 or proving none exists, and the mystery orbits by either realizing one with a graph model or finding a holographic entropy inequality that it violates.","tokens_in":87582,"feed_emoji":"🧮","tokens_out":16207,"duration_ms":92632,"temperature":0.7,"pith_summary":"This paper pins down the full list of atomic entropy patterns — extreme rays — that a six-party quantum system can exhibit while obeying strong subadditivity, the key constraint relating the entropies of overlapping subsystems. The list contains exactly 208 genuinely six-party orbits: 52 violate at least one known holographic entropy inequality and are therefore not holographic, 150 are explicitly realized by holographic graph models, and 6 remain unresolved. The enumeration matters because a leading conjecture holds that holographic entropy cones for any number of parties can be reconstructed from such extreme rays at larger party number, and because it tests whether every holographic ray is realizable by a tree-shaped graph: 148 of the 150 constructed graphs are trees, while 2 contain bulk cycles. A second result is methodological: a general algorithm that finds extreme rays corresponding to down-sets in a poset of inequalities, applicable to any polyhedral cone whose constraints carry a partial order. The computation also shows that a weaker condition called Klein's condition is not exactly equivalent to strong subadditivity at six parties, since 12 Klein-compatible extreme rays violate it.","feed_headline":"Six-party entropy census: 208 extreme rays, 150 holographic","feed_subtitle":"Complete enumeration splits the rays into 150 holographic, 52 non-holographic, and 6 unresolved orbits.","key_machinery":"The load-bearing object is the mutual information poset: the set of all subadditivity instances $I(J:K) \\geq 0$, ordered by containment of the subsystems involved, so that the saturated instances of any strong-subadditivity-compatible extreme ray must form a down-set, a set closed under passing to smaller instances (this down-set condition is Klein's condition). The search is restricted by the Bell pairs theorem to the face $F^*$ of the cone, whose down-sets contain all single-party vanishings, and to down-sets containing no maximal or next-to-maximal elements, which would correspond to lifted or decomposable rays. The algorithm enumerates such down-sets using composable closure operators — down-set closure, linear-dependence closure, and face closure — to discard subsets that cannot correspond to faces of the cone, while the stabilizer of the party-permutation group quotients equivalent branches and an excluded region of saturated inequalities prunes already-explored territory. A completeness theorem shows that no down-set extreme ray outside the excluded region is missed.","core_discovery":"The paper's central claim is that the set $R^6_{\\rm SSA}$ — all extreme rays of the six-party subadditivity cone that are compatible with strong subadditivity — consists of exactly 208 orbits of genuinely six-party rays under permutations of the parties and the purifier. Of these, 52 violate at least one of the 1,877 known holographic entropy inequalities and therefore lie outside the six-party holographic entropy cone; 150 are explicitly realized by holographic graph models, weighted networks whose min-cut entropies reproduce the boundary entropies of holographic states, placing them inside it; and the remaining 6 orbits are unresolved, violating no known inequality while still lacking a graph model. The paper further shows that the inclusion $R^6_{\\rm SSA} \\subset R^6_{\\rm KC}$ is strict: the set of extreme rays satisfying Klein's condition, a down-set condition on saturated subadditivity instances that follows from strong subadditivity, contains 220 orbits, 12 of which violate strong subadditivity — the first demonstration that the two conditions differ at the extreme-ray level. Among the constructed graph models, 148 have tree topology, consistent with the strong form of the tree conjecture, while two orbits (labeled #111 and #207) are realized only by graphs containing a bulk cycle, leaving open whether equivalent tree models exist.","pith_inferences":["The algorithm is a reusable tool independent of entropy: any polyhedral cone whose defining inequalities carry a partial order — for instance stabilizer or hypergraph entropy cones, or linear programs over down-sets — can be enumerated by the same procedure and the same completeness proof.","The two bulk-cycle graphs are the sharpest available stress test of the strong tree conjecture: a fine-graining search at seven or more parties that finds tree realizations would corroborate it, whereas a proof that none exists would yield the first tree-less holographic extreme ray.","The six mystery orbits are the most promising site for new holographic entropy inequalities; if one of them violates an inequality outside the current list of 1,877, the yet-incomplete six-party holographic cone has an additional facet family.","The pattern that every non-holographic orbit violates an inequality involving at most five parties, with none violating only six-party inequalities, hints at a general principle — that holographic status at N is already decided by smaller-N inequalities — which the paper's data supports but does not prove."],"forward_implications":["The holographic status of the six-party subadditivity cone is now fixed up to six orbits, so any future derivation of six-party holographic entropy inequalities must be consistent with these 208 rays.","Twenty-five of the constructed graph models realize extreme rays of the six-party holographic entropy cone that were previously unknown, adding new data beyond the previously catalogued holographic rays.","Klein's condition is a strict approximation to strong subadditivity at six parties, ruling out the earlier speculation that the two conditions coincide for extreme rays at every party number.","Whether the strong tree conjecture survives at six parties reduces to a concrete target list: the two bulk-cycle orbits (#111 and #207) plus the six mystery orbits.","If the reconstruction conjecture is correct, the split computed here — 150 holographic, 52 non-holographic, 6 unresolved — is the essential data from which six-party holographic entropy inequalities can in principle be reconstructed."],"supporting_citations":[{"why":"Supplies the Bell pairs theorem (Corollary 1) and the maximal-element exclusion property that justify restricting the search to the face F*; also introduces the Klein-condition and MI-poset framework and the R⁵_KC = R⁵_SSA result this work extends.","marker":"[24]"},{"why":"Proposes the two conjectures being tested — that holographic entropy cones can be reconstructed from holographic extreme rays at larger N, and the strong form that every holographic ray is realizable by a tree graph model.","marker":"[1]"},{"why":"Provides the 1,877 known holographic entropy inequalities used to certify that 52 of the orbits are non-holographic.","marker":"[17]"},{"why":"Proves the earlier gap result R_Hol ⊂ R_QM at N = 6 and gives the hypergraph realizing orbit #118, motivating the systematic enumeration.","marker":"[23]"},{"why":"Introduces holographic graph models and the holographic entropy cone, the framework underlying all 150 graph realizations.","marker":"[15]"},{"why":"Supplies the β-set necessary condition for simple-tree realizability that the authors check for all 220 Klein-compatible orbits.","marker":"[44]"},{"why":"The holographic entropy cone database providing labels for the 125 previously known holographic orbits and the baseline for the 25 new ones.","marker":"[45]"},{"why":"Formulates the quantum marginal independence problem and provides the R⁵_SSA computation that the present six-party census extends.","marker":"[21]"}],"fun_headline_variants":["Six-party SSA rays: 208 orbits, 150 holographic, 6 open","All 208 six-party SSA extreme rays: 150 holographic","208 six-party rays: 150 holographic, 52 non-holographic, 6 unknown","Two bulk-cycle rays test tree conjecture in six-party entropy"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The enumeration's load-bearing premise is that the Bell pairs theorem and the maximal-element exclusion property, both imported from the authors' earlier work, are valid for arbitrary six-party faces of the subadditivity cone; if either fails, the restricted search could miss genuine extreme rays and the 208-orbit count would be wrong.","fun_headline_variants_meta":{"raw":{"variants":["Six-party SSA rays: 208 orbits, 150 holographic, 6 open","All 208 six-party SSA extreme rays: 150 holographic","208 six-party rays: 150 holographic, 52 non-holographic, 6 unknown","Two bulk-cycle rays test tree conjecture in six-party entropy"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001364,"raw_usage":{"total_tokens":5580,"prompt_tokens":1039,"completion_tokens":4541,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":655,"completion_tokens_details":{"reasoning_tokens":4455}},"tokens_in":655,"tokens_out":4541,"duration_ms":31773,"temperature":1.0,"reasoning_tokens":4455,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T11:29:43.681344+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run an independent extreme-ray computation on the cone cut out by all six-party subadditivity instances together with all strong-subadditivity instances, reduced to the face $F^*$ where all single-party mutual informations vanish, and compare with the 208 listed orbits: any extreme ray outside the party-permutation orbits, or any listed ray that fails a direct strong-subadditivity check, refutes the enumeration. The tree question is settled by either constructing a fine-grained tree model for orbits #111 and #207 or proving none exists, and the mystery orbits by either realizing one with a graph model or finding a holographic entropy inequality that it violates.","supporting_citations":[{"cited_title":"Holographic Entropy Cone Database,","cited_arxiv_id":null,"evidence_quote":"The holographic entropy cone database providing labels for the 125 previously known holographic orbits and the baseline for the 25 new ones."}],"review_version":1}