{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GQWJGAZKCTR7BSA3FXE43XZQHX","short_pith_number":"pith:GQWJGAZK","schema_version":"1.0","canonical_sha256":"342c93032a14e3f0c81b2dc9cddf303dffac73512538de37df7d7e837364035d","source":{"kind":"arxiv","id":"2601.19979","version":2},"attestation_state":"computed","paper":{"title":"Exploring the holographic entropy cone via reinforcement learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Reinforcement learning finds graph realizations for three of six mystery extreme rays in the N=6 holographic entropy cone.","cross_cats":["cs.LG","quant-ph"],"primary_cat":"hep-th","authors_text":"Hirosi Ooguri, Jaeha Lee, Temple He","submitted_at":"2026-01-27T19:00:01Z","abstract_excerpt":"We develop a reinforcement learning algorithm to study the holographic entropy cone. Given a target entropy vector, our algorithm searches for a graph realization whose min-cut entropies match the target vector. If the target vector does not admit such a graph realization, it must lie outside the cone, in which case the algorithm finds a graph whose corresponding entropy vector most nearly approximates the target and allows us to probe the location of the facets. For the $\\sf N=3$ cone, we confirm that our algorithm successfully rediscovers monogamy of mutual information beginning with a targe"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2601.19979","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"hep-th","submitted_at":"2026-01-27T19:00:01Z","cross_cats_sorted":["cs.LG","quant-ph"],"title_canon_sha256":"a8fccb8387451990c060574b8c986aff0821a77d213352adb805006ac7c67a04","abstract_canon_sha256":"b394f32bbfcc70f8b900566471fa31ba2fd66b40538231414d70b194d55b415d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:24.182118Z","signature_b64":"vzYXuP3D5S6eT6tEsoK/1ZRvzNLXaUZzD/1yqkmqT1h0j/MwuB0eD4nzJNdvM1PYL5XNQOljkuLh6RAeBUZEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"342c93032a14e3f0c81b2dc9cddf303dffac73512538de37df7d7e837364035d","last_reissued_at":"2026-05-18T03:09:24.181441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:24.181441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring the holographic entropy cone via reinforcement learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Reinforcement learning finds graph realizations for three of six mystery extreme rays in the N=6 holographic entropy cone.","cross_cats":["cs.LG","quant-ph"],"primary_cat":"hep-th","authors_text":"Hirosi Ooguri, Jaeha Lee, Temple He","submitted_at":"2026-01-27T19:00:01Z","abstract_excerpt":"We develop a reinforcement learning algorithm to study the holographic entropy cone. Given a target entropy vector, our algorithm searches for a graph realization whose min-cut entropies match the target vector. If the target vector does not admit such a graph realization, it must lie outside the cone, in which case the algorithm finds a graph whose corresponding entropy vector most nearly approximates the target and allows us to probe the location of the facets. For the $\\sf N=3$ cone, we confirm that our algorithm successfully rediscovers monogamy of mutual information beginning with a targe"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We found realizations for 3 of them, proving they are genuine extreme rays of the holographic entropy cone, while providing evidence that the remaining 3 are not realizable, implying unknown holographic inequalities exist for N=6.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the reinforcement-learning search is sufficiently exhaustive: if a graph realization exists, the algorithm will find it, and repeated failure therefore constitutes reliable evidence that no realization exists.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Reinforcement learning finds explicit graph realizations for three of six previously unresolved extreme rays of the N=6 holographic entropy cone and supplies evidence that the other three lie outside it.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Reinforcement learning finds graph realizations for three of six mystery extreme rays in the N=6 holographic entropy cone.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ed73291e995634f86ab19728869dadac9390b7e25766309410c74208d66c720a"},"source":{"id":"2601.19979","kind":"arxiv","version":2},"verdict":{"id":"c61dd117-8654-4849-a1ce-fc33050c4b91","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T10:15:53.331967Z","strongest_claim":"We found realizations for 3 of them, proving they are genuine extreme rays of the holographic entropy cone, while providing evidence that the remaining 3 are not realizable, implying unknown holographic inequalities exist for N=6.","one_line_summary":"Reinforcement learning finds explicit graph realizations for three of six previously unresolved extreme rays of the N=6 holographic entropy cone and supplies evidence that the other three lie outside it.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the reinforcement-learning search is sufficiently exhaustive: if a graph realization exists, the algorithm will find it, and repeated failure therefore constitutes reliable evidence that no realization exists.","pith_extraction_headline":"Reinforcement learning finds graph realizations for three of six mystery extreme rays in the N=6 holographic entropy cone."},"references":{"count":47,"sample":[{"doi":"","year":2025,"title":"Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the N = 6 solution,","work_id":"afb41e65-5bf2-4677-abca-b22819717928","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2003,"title":"The inequalities of quantum information theory,","work_id":"f85599a6-fde2-44fc-8f89-f000d971c5d6","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"The Holographic Entropy Cone","work_id":"0fd82b8d-fea2-455c-a008-f9db67e9bde2","ref_index":3,"cited_arxiv_id":"1505.07839","is_internal_anchor":true},{"doi":"","year":2006,"title":"Holographic Derivation of Entanglement Entropy from AdS/CFT","work_id":"c003cd69-f0b8-4fa7-8a41-ec40b0accb07","ref_index":4,"cited_arxiv_id":"hep-th/0603001","is_internal_anchor":true},{"doi":"","year":2019,"title":"Holographic Entropy Relations Repackaged,","work_id":"12c066b0-8301-4b86-8508-aed38bde6a62","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":47,"snapshot_sha256":"c147a7fbd3ee3a2fb0b403041369755523b3680c4d0c48ee1ca8dabf051ca234","internal_anchors":8},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f228e69ef42ecb918ca45e0451bd7430e104f982bb95ae8264d81be56718dc1d"},"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":"2601.19979","created_at":"2026-05-18T03:09:24.181564+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.19979v2","created_at":"2026-05-18T03:09:24.181564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.19979","created_at":"2026-05-18T03:09:24.181564+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQWJGAZKCTR7","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQWJGAZKCTR7BSA3","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQWJGAZK","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GQWJGAZKCTR7BSA3FXE43XZQHX","json":"https://pith.science/pith/GQWJGAZKCTR7BSA3FXE43XZQHX.json","graph_json":"https://pith.science/api/pith-number/GQWJGAZKCTR7BSA3FXE43XZQHX/graph.json","events_json":"https://pith.science/api/pith-number/GQWJGAZKCTR7BSA3FXE43XZQHX/events.json","paper":"https://pith.science/paper/GQWJGAZK"},"agent_actions":{"view_html":"https://pith.science/pith/GQWJGAZKCTR7BSA3FXE43XZQHX","download_json":"https://pith.science/pith/GQWJGAZKCTR7BSA3FXE43XZQHX.json","view_paper":"https://pith.science/paper/GQWJGAZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.19979&json=true","fetch_graph":"https://pith.science/api/pith-number/GQWJGAZKCTR7BSA3FXE43XZQHX/graph.json","fetch_events":"https://pith.science/api/pith-number/GQWJGAZKCTR7BSA3FXE43XZQHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQWJGAZKCTR7BSA3FXE43XZQHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQWJGAZKCTR7BSA3FXE43XZQHX/action/storage_attestation","attest_author":"https://pith.science/pith/GQWJGAZKCTR7BSA3FXE43XZQHX/action/author_attestation","sign_citation":"https://pith.science/pith/GQWJGAZKCTR7BSA3FXE43XZQHX/action/citation_signature","submit_replication":"https://pith.science/pith/GQWJGAZKCTR7BSA3FXE43XZQHX/action/replication_record"}},"created_at":"2026-05-18T03:09:24.181564+00:00","updated_at":"2026-05-18T03:09:24.181564+00:00"}