{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DNZDC52M7JEUFGGU5ALPGAAHUU","short_pith_number":"pith:DNZDC52M","schema_version":"1.0","canonical_sha256":"1b7231774cfa494298d4e816f30007a507902f01864ab09e2a203e1f6665c940","source":{"kind":"arxiv","id":"1003.1320","version":4},"attestation_state":"computed","paper":{"title":"Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Christian Wulff-Nilsen, Glencora Borradaile, Piotr Sankowski","submitted_at":"2010-03-05T17:43:56Z","abstract_excerpt":"For an undirected $n$-vertex planar graph $G$ with non-negative edge-weights, we consider the following type of query: given two vertices $s$ and $t$ in $G$, what is the weight of a min $st$-cut in $G$? We show how to answer such queries in constant time with $O(n\\log^4n)$ preprocessing time and $O(n\\log n)$ space. We use a Gomory-Hu tree to represent all the pairwise min cuts implicitly. Previously, no subquadratic time algorithm was known for this problem. Since all-pairs min cut and the minimum cycle basis are dual problems in planar graphs, we also obtain an implicit representation of a mi"},"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":"1003.1320","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-03-05T17:43:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ea9647f5265ec2b63dfa04baea68d7a678a372ca5d4e3e23bacef45ffab70a7b","abstract_canon_sha256":"94c0525adf91bddab14bddd0c94e5da23caa6c32c469d162c0088f82cf03a178"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:58.726198Z","signature_b64":"xO8600Em/PxhIRxa5vaor+GmbceabO8WbFkjpttn7oJFz1KeK66ST9M/ZkE7pCF4F7RPTylbqrLRty57tJjcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b7231774cfa494298d4e816f30007a507902f01864ab09e2a203e1f6665c940","last_reissued_at":"2026-05-18T03:10:58.725460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:58.725460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Christian Wulff-Nilsen, Glencora Borradaile, Piotr Sankowski","submitted_at":"2010-03-05T17:43:56Z","abstract_excerpt":"For an undirected $n$-vertex planar graph $G$ with non-negative edge-weights, we consider the following type of query: given two vertices $s$ and $t$ in $G$, what is the weight of a min $st$-cut in $G$? We show how to answer such queries in constant time with $O(n\\log^4n)$ preprocessing time and $O(n\\log n)$ space. We use a Gomory-Hu tree to represent all the pairwise min cuts implicitly. Previously, no subquadratic time algorithm was known for this problem. Since all-pairs min cut and the minimum cycle basis are dual problems in planar graphs, we also obtain an implicit representation of a mi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.1320","kind":"arxiv","version":4},"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":"1003.1320","created_at":"2026-05-18T03:10:58.725594+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.1320v4","created_at":"2026-05-18T03:10:58.725594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.1320","created_at":"2026-05-18T03:10:58.725594+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNZDC52M7JEU","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNZDC52M7JEUFGGU","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNZDC52M","created_at":"2026-05-18T12:26:06.534383+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/DNZDC52M7JEUFGGU5ALPGAAHUU","json":"https://pith.science/pith/DNZDC52M7JEUFGGU5ALPGAAHUU.json","graph_json":"https://pith.science/api/pith-number/DNZDC52M7JEUFGGU5ALPGAAHUU/graph.json","events_json":"https://pith.science/api/pith-number/DNZDC52M7JEUFGGU5ALPGAAHUU/events.json","paper":"https://pith.science/paper/DNZDC52M"},"agent_actions":{"view_html":"https://pith.science/pith/DNZDC52M7JEUFGGU5ALPGAAHUU","download_json":"https://pith.science/pith/DNZDC52M7JEUFGGU5ALPGAAHUU.json","view_paper":"https://pith.science/paper/DNZDC52M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.1320&json=true","fetch_graph":"https://pith.science/api/pith-number/DNZDC52M7JEUFGGU5ALPGAAHUU/graph.json","fetch_events":"https://pith.science/api/pith-number/DNZDC52M7JEUFGGU5ALPGAAHUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNZDC52M7JEUFGGU5ALPGAAHUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNZDC52M7JEUFGGU5ALPGAAHUU/action/storage_attestation","attest_author":"https://pith.science/pith/DNZDC52M7JEUFGGU5ALPGAAHUU/action/author_attestation","sign_citation":"https://pith.science/pith/DNZDC52M7JEUFGGU5ALPGAAHUU/action/citation_signature","submit_replication":"https://pith.science/pith/DNZDC52M7JEUFGGU5ALPGAAHUU/action/replication_record"}},"created_at":"2026-05-18T03:10:58.725594+00:00","updated_at":"2026-05-18T03:10:58.725594+00:00"}