{"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"}