{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EAXZFNOBNTGL4FG3N5HU7XVRJQ","short_pith_number":"pith:EAXZFNOB","schema_version":"1.0","canonical_sha256":"202f92b5c16cccbe14db6f4f4fdeb14c34e86a318a397036996c0ffe5972d9cf","source":{"kind":"arxiv","id":"1609.01727","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Identifying Ryu-Takayanagi Surfaces in AdS3/CFT2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","gr-qc","quant-ph"],"primary_cat":"hep-th","authors_text":"Aidan Chatwin-Davies, Ning Bao","submitted_at":"2016-09-06T20:00:06Z","abstract_excerpt":"We present a constructive algorithm for the determination of Ryu-Takayanagi surfaces in AdS3/CFT2 which exploits previously noted connections between holographic entanglement entropy and max-flow/min-cut. We then characterize its complexity as a polynomial time algorithm."},"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":"1609.01727","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2016-09-06T20:00:06Z","cross_cats_sorted":["cs.CC","gr-qc","quant-ph"],"title_canon_sha256":"17c4be53c5710d2f86575bb4fd1955217ee366d1a43cc1c9de38523d7646eb2c","abstract_canon_sha256":"bccb0b918983a934627cd8203a8f97bfe41e41c58a4401add64b2882db4ce33b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:10.787512Z","signature_b64":"7LrkfB24cqW1kBYS1iq63M5mRRzArfIXPJQutsYqUGZy2rZht8WicRyFrAdnSB7WFkGbYYsYVMIx1+/BDKguDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"202f92b5c16cccbe14db6f4f4fdeb14c34e86a318a397036996c0ffe5972d9cf","last_reissued_at":"2026-05-18T00:57:10.787016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:10.787016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Identifying Ryu-Takayanagi Surfaces in AdS3/CFT2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","gr-qc","quant-ph"],"primary_cat":"hep-th","authors_text":"Aidan Chatwin-Davies, Ning Bao","submitted_at":"2016-09-06T20:00:06Z","abstract_excerpt":"We present a constructive algorithm for the determination of Ryu-Takayanagi surfaces in AdS3/CFT2 which exploits previously noted connections between holographic entanglement entropy and max-flow/min-cut. We then characterize its complexity as a polynomial time algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01727","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1609.01727","created_at":"2026-05-18T00:57:10.787084+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.01727v2","created_at":"2026-05-18T00:57:10.787084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01727","created_at":"2026-05-18T00:57:10.787084+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAXZFNOBNTGL","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAXZFNOBNTGL4FG3","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAXZFNOB","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EAXZFNOBNTGL4FG3N5HU7XVRJQ","json":"https://pith.science/pith/EAXZFNOBNTGL4FG3N5HU7XVRJQ.json","graph_json":"https://pith.science/api/pith-number/EAXZFNOBNTGL4FG3N5HU7XVRJQ/graph.json","events_json":"https://pith.science/api/pith-number/EAXZFNOBNTGL4FG3N5HU7XVRJQ/events.json","paper":"https://pith.science/paper/EAXZFNOB"},"agent_actions":{"view_html":"https://pith.science/pith/EAXZFNOBNTGL4FG3N5HU7XVRJQ","download_json":"https://pith.science/pith/EAXZFNOBNTGL4FG3N5HU7XVRJQ.json","view_paper":"https://pith.science/paper/EAXZFNOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.01727&json=true","fetch_graph":"https://pith.science/api/pith-number/EAXZFNOBNTGL4FG3N5HU7XVRJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/EAXZFNOBNTGL4FG3N5HU7XVRJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAXZFNOBNTGL4FG3N5HU7XVRJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAXZFNOBNTGL4FG3N5HU7XVRJQ/action/storage_attestation","attest_author":"https://pith.science/pith/EAXZFNOBNTGL4FG3N5HU7XVRJQ/action/author_attestation","sign_citation":"https://pith.science/pith/EAXZFNOBNTGL4FG3N5HU7XVRJQ/action/citation_signature","submit_replication":"https://pith.science/pith/EAXZFNOBNTGL4FG3N5HU7XVRJQ/action/replication_record"}},"created_at":"2026-05-18T00:57:10.787084+00:00","updated_at":"2026-05-18T00:57:10.787084+00:00"}