{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:P6VELE2U5Y2V7XGQF66YNUQWBY","short_pith_number":"pith:P6VELE2U","schema_version":"1.0","canonical_sha256":"7faa459354ee355fdcd02fbd86d2160e3ed2c3590e8bdfa3a7463a006a02738d","source":{"kind":"arxiv","id":"1604.00354","version":3},"attestation_state":"computed","paper":{"title":"Bit threads and holographic entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DG","math.OC","quant-ph"],"primary_cat":"hep-th","authors_text":"Matthew Headrick, Michael Freedman","submitted_at":"2016-04-01T18:40:24Z","abstract_excerpt":"The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT formula in a way that does not make reference to the minimal surface. Instead, we invoke the notion of a \"flow\", defined as a divergenceless norm-bounded vector field, or equivalently a set of Planck-thickness \"bit threads\". The entanglement entropy of a boundary region is given by the maximum flux out of it of any flow, or equivalently the maximum number o"},"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":"1604.00354","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2016-04-01T18:40:24Z","cross_cats_sorted":["math.DG","math.OC","quant-ph"],"title_canon_sha256":"575a39531c96657c206594cc8a449f5a78279195541f09489d42b087ce342de8","abstract_canon_sha256":"809450c09f8c542ec8ce8cb7c6312ee2b1e169eef7bc163e978640dd24eceb99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:33.339632Z","signature_b64":"puhzeCuifo+P5uvnmIro/+hPyyGhrMHgncLrpA3MoPhCqpo3w1K/yCf9R9+aKKWPDUbYyS9iUveBgxKxwvvPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7faa459354ee355fdcd02fbd86d2160e3ed2c3590e8bdfa3a7463a006a02738d","last_reissued_at":"2026-05-18T00:07:33.338894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:33.338894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bit threads and holographic entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DG","math.OC","quant-ph"],"primary_cat":"hep-th","authors_text":"Matthew Headrick, Michael Freedman","submitted_at":"2016-04-01T18:40:24Z","abstract_excerpt":"The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT formula in a way that does not make reference to the minimal surface. Instead, we invoke the notion of a \"flow\", defined as a divergenceless norm-bounded vector field, or equivalently a set of Planck-thickness \"bit threads\". The entanglement entropy of a boundary region is given by the maximum flux out of it of any flow, or equivalently the maximum number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00354","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":""},"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":"1604.00354","created_at":"2026-05-18T00:07:33.339022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00354v3","created_at":"2026-05-18T00:07:33.339022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00354","created_at":"2026-05-18T00:07:33.339022+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6VELE2U5Y2V","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6VELE2U5Y2V7XGQ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6VELE2U","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2510.22601","citing_title":"Quantum Bit Threads and the Entropohedron","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2511.16586","citing_title":"Toward a worldsheet theory of entanglement entropy","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2512.19452","citing_title":"Holographic Tensor Networks as Tessellations of Geometry","ref_index":67,"is_internal_anchor":true},{"citing_arxiv_id":"2601.19979","citing_title":"Exploring the holographic entropy cone via reinforcement learning","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P6VELE2U5Y2V7XGQF66YNUQWBY","json":"https://pith.science/pith/P6VELE2U5Y2V7XGQF66YNUQWBY.json","graph_json":"https://pith.science/api/pith-number/P6VELE2U5Y2V7XGQF66YNUQWBY/graph.json","events_json":"https://pith.science/api/pith-number/P6VELE2U5Y2V7XGQF66YNUQWBY/events.json","paper":"https://pith.science/paper/P6VELE2U"},"agent_actions":{"view_html":"https://pith.science/pith/P6VELE2U5Y2V7XGQF66YNUQWBY","download_json":"https://pith.science/pith/P6VELE2U5Y2V7XGQF66YNUQWBY.json","view_paper":"https://pith.science/paper/P6VELE2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00354&json=true","fetch_graph":"https://pith.science/api/pith-number/P6VELE2U5Y2V7XGQF66YNUQWBY/graph.json","fetch_events":"https://pith.science/api/pith-number/P6VELE2U5Y2V7XGQF66YNUQWBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6VELE2U5Y2V7XGQF66YNUQWBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6VELE2U5Y2V7XGQF66YNUQWBY/action/storage_attestation","attest_author":"https://pith.science/pith/P6VELE2U5Y2V7XGQF66YNUQWBY/action/author_attestation","sign_citation":"https://pith.science/pith/P6VELE2U5Y2V7XGQF66YNUQWBY/action/citation_signature","submit_replication":"https://pith.science/pith/P6VELE2U5Y2V7XGQF66YNUQWBY/action/replication_record"}},"created_at":"2026-05-18T00:07:33.339022+00:00","updated_at":"2026-05-18T00:07:33.339022+00:00"}