{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:P2KVWHLBDN5AKUYWR7R3CDADZD","short_pith_number":"pith:P2KVWHLB","schema_version":"1.0","canonical_sha256":"7e955b1d611b7a0553168fe3b10c03c8c661a85f346290ac1bd8f6110da24282","source":{"kind":"arxiv","id":"1710.09516","version":1},"attestation_state":"computed","paper":{"title":"Riemannian and Lorentzian flow-cut theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["gr-qc","math.DG"],"primary_cat":"hep-th","authors_text":"Matthew Headrick, Veronika E. Hubeny","submitted_at":"2017-10-26T02:42:12Z","abstract_excerpt":"We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a \"bit-thread\" interpretation of holographic entanglement entropies. We also prove various properties of the max flow and min cut, including respective nesting properties. In the Lorentzian setting, we prove the analogous min flow-max cut theorem, which states that the volume of a maximal slice equals the flux of a minimal flow, where a flow is defined as a divergenceless timelike vector field "},"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":"1710.09516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2017-10-26T02:42:12Z","cross_cats_sorted":["gr-qc","math.DG"],"title_canon_sha256":"682b9754a3fcbf8e463a95a5ae9c3ca95d05fff59d519bc7b3be4f16ff04d0fa","abstract_canon_sha256":"7c2ffd9cffa35c1b89d12b3a6c23fcb3751b5d9ab768c0f89ee7ca191a835cf8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:32.955945Z","signature_b64":"xeBQpLx0v8TriWE9Fq3lljKzwjlIJAthhQJFBogPqZfLXD646R3rShm/CppByleRKN7+isVCBjhyPenjc0PkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e955b1d611b7a0553168fe3b10c03c8c661a85f346290ac1bd8f6110da24282","last_reissued_at":"2026-05-18T00:07:32.955363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:32.955363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Riemannian and Lorentzian flow-cut theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["gr-qc","math.DG"],"primary_cat":"hep-th","authors_text":"Matthew Headrick, Veronika E. Hubeny","submitted_at":"2017-10-26T02:42:12Z","abstract_excerpt":"We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a \"bit-thread\" interpretation of holographic entanglement entropies. We also prove various properties of the max flow and min cut, including respective nesting properties. In the Lorentzian setting, we prove the analogous min flow-max cut theorem, which states that the volume of a maximal slice equals the flux of a minimal flow, where a flow is defined as a divergenceless timelike vector field "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09516","kind":"arxiv","version":1},"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":"1710.09516","created_at":"2026-05-18T00:07:32.955478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.09516v1","created_at":"2026-05-18T00:07:32.955478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09516","created_at":"2026-05-18T00:07:32.955478+00:00"},{"alias_kind":"pith_short_12","alias_value":"P2KVWHLBDN5A","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"P2KVWHLBDN5AKUYW","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"P2KVWHLB","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2510.22601","citing_title":"Quantum Bit Threads and the Entropohedron","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2512.19452","citing_title":"Holographic Tensor Networks as Tessellations of Geometry","ref_index":68,"is_internal_anchor":true},{"citing_arxiv_id":"2601.19979","citing_title":"Exploring the holographic entropy cone via reinforcement learning","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P2KVWHLBDN5AKUYWR7R3CDADZD","json":"https://pith.science/pith/P2KVWHLBDN5AKUYWR7R3CDADZD.json","graph_json":"https://pith.science/api/pith-number/P2KVWHLBDN5AKUYWR7R3CDADZD/graph.json","events_json":"https://pith.science/api/pith-number/P2KVWHLBDN5AKUYWR7R3CDADZD/events.json","paper":"https://pith.science/paper/P2KVWHLB"},"agent_actions":{"view_html":"https://pith.science/pith/P2KVWHLBDN5AKUYWR7R3CDADZD","download_json":"https://pith.science/pith/P2KVWHLBDN5AKUYWR7R3CDADZD.json","view_paper":"https://pith.science/paper/P2KVWHLB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.09516&json=true","fetch_graph":"https://pith.science/api/pith-number/P2KVWHLBDN5AKUYWR7R3CDADZD/graph.json","fetch_events":"https://pith.science/api/pith-number/P2KVWHLBDN5AKUYWR7R3CDADZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P2KVWHLBDN5AKUYWR7R3CDADZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P2KVWHLBDN5AKUYWR7R3CDADZD/action/storage_attestation","attest_author":"https://pith.science/pith/P2KVWHLBDN5AKUYWR7R3CDADZD/action/author_attestation","sign_citation":"https://pith.science/pith/P2KVWHLBDN5AKUYWR7R3CDADZD/action/citation_signature","submit_replication":"https://pith.science/pith/P2KVWHLBDN5AKUYWR7R3CDADZD/action/replication_record"}},"created_at":"2026-05-18T00:07:32.955478+00:00","updated_at":"2026-05-18T00:07:32.955478+00:00"}