{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZQS67SMRLYCISKHJP62LSGWSJQ","short_pith_number":"pith:ZQS67SMR","schema_version":"1.0","canonical_sha256":"cc25efc9915e048928e97fb4b91ad24c36422cb007a38832132725a1a21d2f54","source":{"kind":"arxiv","id":"2412.15364","version":3},"attestation_state":"computed","paper":{"title":"Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the ${\\sf N}=6$ solution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["hep-th"],"primary_cat":"quant-ph","authors_text":"Massimiliano Rota, Temple He, Veronika E. Hubeny","submitted_at":"2024-12-19T19:51:02Z","abstract_excerpt":"We compute the set of all extreme rays of the 6-party subadditivity cone that are compatible with strong subadditivity. In total, we identify 208 new (genuine 6-party) orbits, 52 of which violate at least one known holographic entropy inequality. For the remaining 156 orbits, which do not violate any such inequalities, we construct holographic graph models for 150 of them. For the final 6 orbits, it remains an open question whether they are holographic. Consistent with the strong form of the conjecture in arXiv:2204.00075, 148 of these graph models are trees. However, 2 of the graphs contain a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.15364","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-19T19:51:02Z","cross_cats_sorted":["hep-th"],"title_canon_sha256":"1a53e11336289e3004727bb93b9d94b84b1ea57ce172b89b3c1e4fa904eeb60e","abstract_canon_sha256":"f7a25e28e43f84eaaf6785ad3ee8999d5c9036fb47dcdeecb3994380a9fdc128"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:46.557500Z","signature_b64":"uxCA6tzSKOGi9HOX/AQkZVb9l9m6j4/stiEXU7bVZg/yyZb+rMwUZ073vGs0rLVTvwsJAfJQ3TkqaDMuBu9HBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc25efc9915e048928e97fb4b91ad24c36422cb007a38832132725a1a21d2f54","last_reissued_at":"2026-07-05T11:39:46.556986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:46.556986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the ${\\sf N}=6$ solution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["hep-th"],"primary_cat":"quant-ph","authors_text":"Massimiliano Rota, Temple He, Veronika E. Hubeny","submitted_at":"2024-12-19T19:51:02Z","abstract_excerpt":"We compute the set of all extreme rays of the 6-party subadditivity cone that are compatible with strong subadditivity. In total, we identify 208 new (genuine 6-party) orbits, 52 of which violate at least one known holographic entropy inequality. For the remaining 156 orbits, which do not violate any such inequalities, we construct holographic graph models for 150 of them. For the final 6 orbits, it remains an open question whether they are holographic. Consistent with the strong form of the conjecture in arXiv:2204.00075, 148 of these graph models are trees. However, 2 of the graphs contain a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.15364","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.15364/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.15364","created_at":"2026-07-05T11:39:46.557045+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.15364v3","created_at":"2026-07-05T11:39:46.557045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.15364","created_at":"2026-07-05T11:39:46.557045+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQS67SMRLYCI","created_at":"2026-07-05T11:39:46.557045+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQS67SMRLYCISKHJ","created_at":"2026-07-05T11:39:46.557045+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQS67SMR","created_at":"2026-07-05T11:39:46.557045+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.19979","citing_title":"Exploring the holographic entropy cone via reinforcement learning","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZQS67SMRLYCISKHJP62LSGWSJQ","json":"https://pith.science/pith/ZQS67SMRLYCISKHJP62LSGWSJQ.json","graph_json":"https://pith.science/api/pith-number/ZQS67SMRLYCISKHJP62LSGWSJQ/graph.json","events_json":"https://pith.science/api/pith-number/ZQS67SMRLYCISKHJP62LSGWSJQ/events.json","paper":"https://pith.science/paper/ZQS67SMR"},"agent_actions":{"view_html":"https://pith.science/pith/ZQS67SMRLYCISKHJP62LSGWSJQ","download_json":"https://pith.science/pith/ZQS67SMRLYCISKHJP62LSGWSJQ.json","view_paper":"https://pith.science/paper/ZQS67SMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.15364&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQS67SMRLYCISKHJP62LSGWSJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQS67SMRLYCISKHJP62LSGWSJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQS67SMRLYCISKHJP62LSGWSJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQS67SMRLYCISKHJP62LSGWSJQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZQS67SMRLYCISKHJP62LSGWSJQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZQS67SMRLYCISKHJP62LSGWSJQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZQS67SMRLYCISKHJP62LSGWSJQ/action/replication_record"}},"created_at":"2026-07-05T11:39:46.557045+00:00","updated_at":"2026-07-05T11:39:46.557045+00:00"}