{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GQWJGAZKCTR7BSA3FXE43XZQHX","short_pith_number":"pith:GQWJGAZK","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"},"canonical_sha256":"342c93032a14e3f0c81b2dc9cddf303dffac73512538de37df7d7e837364035d","source":{"kind":"arxiv","id":"2601.19979","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.19979","created_at":"2026-05-18T03:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"2601.19979v2","created_at":"2026-05-18T03:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.19979","created_at":"2026-05-18T03:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"GQWJGAZKCTR7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GQWJGAZKCTR7BSA3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GQWJGAZK","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GQWJGAZKCTR7BSA3FXE43XZQHX","target":"record","payload":{"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"},"canonical_sha256":"342c93032a14e3f0c81b2dc9cddf303dffac73512538de37df7d7e837364035d","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"},"source_kind":"arxiv","source_id":"2601.19979","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XI26iBEWojcZ4dqV1z7NuZfixhk3nL5ROTYnXrTnhZnAGEzsng8v8gcC7BMAzkedMSkzErH9CceKdTAwlGokAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:11:14.294619Z"},"content_sha256":"4256d3b99ca582ecc82b958cfa1bcd3b2b88f53c8cbac57f3ce10075238e9e3d","schema_version":"1.0","event_id":"sha256:4256d3b99ca582ecc82b958cfa1bcd3b2b88f53c8cbac57f3ce10075238e9e3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GQWJGAZKCTR7BSA3FXE43XZQHX","target":"graph","payload":{"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"},"verdict_id":"c61dd117-8654-4849-a1ce-fc33050c4b91"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GokE6ZRr7NBTFu/CY93TvhOyp9gF6CUTFC53BJeM5VWAOi6n/YmR7Qv31wXUjSTghyjF5t+JmXgGVxU5FF9+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:11:14.295586Z"},"content_sha256":"bf1a715ff5e7375b94e3191919990521c4c45ef0ea8ce7c2da16a540dec133df","schema_version":"1.0","event_id":"sha256:bf1a715ff5e7375b94e3191919990521c4c45ef0ea8ce7c2da16a540dec133df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQWJGAZKCTR7BSA3FXE43XZQHX/bundle.json","state_url":"https://pith.science/pith/GQWJGAZKCTR7BSA3FXE43XZQHX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQWJGAZKCTR7BSA3FXE43XZQHX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T23:11:14Z","links":{"resolver":"https://pith.science/pith/GQWJGAZKCTR7BSA3FXE43XZQHX","bundle":"https://pith.science/pith/GQWJGAZKCTR7BSA3FXE43XZQHX/bundle.json","state":"https://pith.science/pith/GQWJGAZKCTR7BSA3FXE43XZQHX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQWJGAZKCTR7BSA3FXE43XZQHX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GQWJGAZKCTR7BSA3FXE43XZQHX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b394f32bbfcc70f8b900566471fa31ba2fd66b40538231414d70b194d55b415d","cross_cats_sorted":["cs.LG","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"hep-th","submitted_at":"2026-01-27T19:00:01Z","title_canon_sha256":"a8fccb8387451990c060574b8c986aff0821a77d213352adb805006ac7c67a04"},"schema_version":"1.0","source":{"id":"2601.19979","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.19979","created_at":"2026-05-18T03:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"2601.19979v2","created_at":"2026-05-18T03:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.19979","created_at":"2026-05-18T03:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"GQWJGAZKCTR7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GQWJGAZKCTR7BSA3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GQWJGAZK","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:bf1a715ff5e7375b94e3191919990521c4c45ef0ea8ce7c2da16a540dec133df","target":"graph","created_at":"2026-05-18T03:09:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Reinforcement learning finds graph realizations for three of six mystery extreme rays in the N=6 holographic entropy cone."}],"snapshot_sha256":"ed73291e995634f86ab19728869dadac9390b7e25766309410c74208d66c720a"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f228e69ef42ecb918ca45e0451bd7430e104f982bb95ae8264d81be56718dc1d"},"paper":{"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","authors_text":"Hirosi Ooguri, Jaeha Lee, Temple He","cross_cats":["cs.LG","quant-ph"],"headline":"Reinforcement learning finds graph realizations for three of six mystery extreme rays in the N=6 holographic entropy cone.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"hep-th","submitted_at":"2026-01-27T19:00:01Z","title":"Exploring the holographic entropy cone via reinforcement learning"},"references":{"count":47,"internal_anchors":8,"resolved_work":47,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the N = 6 solution,","work_id":"afb41e65-5bf2-4677-abca-b22819717928","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"The inequalities of quantum information theory,","work_id":"f85599a6-fde2-44fc-8f89-f000d971c5d6","year":2003},{"cited_arxiv_id":"1505.07839","doi":"","is_internal_anchor":true,"ref_index":3,"title":"The Holographic Entropy Cone","work_id":"0fd82b8d-fea2-455c-a008-f9db67e9bde2","year":2015},{"cited_arxiv_id":"hep-th/0603001","doi":"","is_internal_anchor":true,"ref_index":4,"title":"Holographic Derivation of Entanglement Entropy from AdS/CFT","work_id":"c003cd69-f0b8-4fa7-8a41-ec40b0accb07","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Holographic Entropy Relations Repackaged,","work_id":"12c066b0-8301-4b86-8508-aed38bde6a62","year":2019}],"snapshot_sha256":"c147a7fbd3ee3a2fb0b403041369755523b3680c4d0c48ee1ca8dabf051ca234"},"source":{"id":"2601.19979","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T10:15:53.331967Z","id":"c61dd117-8654-4849-a1ce-fc33050c4b91","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Reinforcement learning finds graph realizations for three of six mystery extreme rays in the N=6 holographic entropy cone.","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.","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."}},"verdict_id":"c61dd117-8654-4849-a1ce-fc33050c4b91"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4256d3b99ca582ecc82b958cfa1bcd3b2b88f53c8cbac57f3ce10075238e9e3d","target":"record","created_at":"2026-05-18T03:09:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b394f32bbfcc70f8b900566471fa31ba2fd66b40538231414d70b194d55b415d","cross_cats_sorted":["cs.LG","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"hep-th","submitted_at":"2026-01-27T19:00:01Z","title_canon_sha256":"a8fccb8387451990c060574b8c986aff0821a77d213352adb805006ac7c67a04"},"schema_version":"1.0","source":{"id":"2601.19979","kind":"arxiv","version":2}},"canonical_sha256":"342c93032a14e3f0c81b2dc9cddf303dffac73512538de37df7d7e837364035d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"342c93032a14e3f0c81b2dc9cddf303dffac73512538de37df7d7e837364035d","first_computed_at":"2026-05-18T03:09:24.181441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:24.181441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vzYXuP3D5S6eT6tEsoK/1ZRvzNLXaUZzD/1yqkmqT1h0j/MwuB0eD4nzJNdvM1PYL5XNQOljkuLh6RAeBUZEDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:24.182118Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.19979","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4256d3b99ca582ecc82b958cfa1bcd3b2b88f53c8cbac57f3ce10075238e9e3d","sha256:bf1a715ff5e7375b94e3191919990521c4c45ef0ea8ce7c2da16a540dec133df"],"state_sha256":"f37b5ce2467345052a9aabcd78f9cf1340c601d63054a542b02b1f7a75556bf8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VOGwoZRTd2D2qdng3WWpR54GvCpiqBQfN0O9VgiKf2TtDY7Jraay9w7dFxWf9LtB2eLeq+ztynGFXsicIkBoDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:11:14.300023Z","bundle_sha256":"42c2695c9e85eb5ff0a6cb74758b0990902ad7cb3443b2ee2169b759cfeba679"}}