{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XJDSZETSYVALTGAPXJIL4JYGLX","short_pith_number":"pith:XJDSZETS","schema_version":"1.0","canonical_sha256":"ba472c9272c540b9980fba50be27065df7e0aff46a2c95aaf0696f98acbccd30","source":{"kind":"arxiv","id":"1811.08879","version":3},"attestation_state":"computed","paper":{"title":"Geometric Aspects of Holographic Bit Threads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["gr-qc"],"primary_cat":"hep-th","authors_text":"Cesar A. Ag\\'on, Jan de Boer, Juan F. Pedraza","submitted_at":"2018-11-21T18:51:20Z","abstract_excerpt":"We revisit the recent reformulation of the holographic prescription to compute entanglement entropy in terms of a convex optimization problem, introduced by Freedman and Headrick. According to it, the holographic entanglement entropy associated to a boundary region is given by the maximum flux of a bounded, divergenceless vector field, through the corresponding region. Our work leads to two main results: (i) We present a general algorithm that allows the construction of explicit thread configurations in cases where the minimal surface is known. We illustrate the method with simple examples: sp"},"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":"1811.08879","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2018-11-21T18:51:20Z","cross_cats_sorted":["gr-qc"],"title_canon_sha256":"6e03f9afef2746f09070bcbd617f0c1eaa8601ebad71cec7809b57156abdc664","abstract_canon_sha256":"b944336fe609b71b0c06a6efefc39355a4d7c2034d614631ea802f2abdaacfa5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:09.353716Z","signature_b64":"SYgk4EtyZ6dUJKBIqM+gWwNE62EZmgk2d5hg3d8ZLq3SpRlH1ypHbFVefBT1tLSXbZffFz2WHqnmDWGbYFvNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba472c9272c540b9980fba50be27065df7e0aff46a2c95aaf0696f98acbccd30","last_reissued_at":"2026-05-17T23:46:09.353237Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:09.353237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric Aspects of Holographic Bit Threads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["gr-qc"],"primary_cat":"hep-th","authors_text":"Cesar A. Ag\\'on, Jan de Boer, Juan F. Pedraza","submitted_at":"2018-11-21T18:51:20Z","abstract_excerpt":"We revisit the recent reformulation of the holographic prescription to compute entanglement entropy in terms of a convex optimization problem, introduced by Freedman and Headrick. According to it, the holographic entanglement entropy associated to a boundary region is given by the maximum flux of a bounded, divergenceless vector field, through the corresponding region. Our work leads to two main results: (i) We present a general algorithm that allows the construction of explicit thread configurations in cases where the minimal surface is known. We illustrate the method with simple examples: sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08879","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":"1811.08879","created_at":"2026-05-17T23:46:09.353310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08879v3","created_at":"2026-05-17T23:46:09.353310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08879","created_at":"2026-05-17T23:46:09.353310+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJDSZETSYVAL","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJDSZETSYVALTGAP","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJDSZETS","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2511.16586","citing_title":"Toward a worldsheet theory of entanglement entropy","ref_index":79,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XJDSZETSYVALTGAPXJIL4JYGLX","json":"https://pith.science/pith/XJDSZETSYVALTGAPXJIL4JYGLX.json","graph_json":"https://pith.science/api/pith-number/XJDSZETSYVALTGAPXJIL4JYGLX/graph.json","events_json":"https://pith.science/api/pith-number/XJDSZETSYVALTGAPXJIL4JYGLX/events.json","paper":"https://pith.science/paper/XJDSZETS"},"agent_actions":{"view_html":"https://pith.science/pith/XJDSZETSYVALTGAPXJIL4JYGLX","download_json":"https://pith.science/pith/XJDSZETSYVALTGAPXJIL4JYGLX.json","view_paper":"https://pith.science/paper/XJDSZETS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08879&json=true","fetch_graph":"https://pith.science/api/pith-number/XJDSZETSYVALTGAPXJIL4JYGLX/graph.json","fetch_events":"https://pith.science/api/pith-number/XJDSZETSYVALTGAPXJIL4JYGLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJDSZETSYVALTGAPXJIL4JYGLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJDSZETSYVALTGAPXJIL4JYGLX/action/storage_attestation","attest_author":"https://pith.science/pith/XJDSZETSYVALTGAPXJIL4JYGLX/action/author_attestation","sign_citation":"https://pith.science/pith/XJDSZETSYVALTGAPXJIL4JYGLX/action/citation_signature","submit_replication":"https://pith.science/pith/XJDSZETSYVALTGAPXJIL4JYGLX/action/replication_record"}},"created_at":"2026-05-17T23:46:09.353310+00:00","updated_at":"2026-05-17T23:46:09.353310+00:00"}