{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CIUVMYOKNQ76AP4ICSJDVH5CAW","short_pith_number":"pith:CIUVMYOK","schema_version":"1.0","canonical_sha256":"12295661ca6c3fe03f8814923a9fa205b08e58b4792544d0b0a486f403ead913","source":{"kind":"arxiv","id":"1411.7055","version":2},"attestation_state":"computed","paper":{"title":"All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Amir Nayyeri, Christian Wulff-Nilsen, David Eppstein, Glencora Borradaile","submitted_at":"2014-11-25T22:23:14Z","abstract_excerpt":"For an undirected $n$-vertex 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 minimum $st$-cut in $G$? We solve this problem in preprocessing time $O(n\\log^3 n)$ for graphs of bounded genus, giving the first sub-quadratic time algorithm for this class of graphs. Our result also improves by a logarithmic factor a previous algorithm by Borradaile, Sankowski and Wulff-Nilsen (FOCS 2010) that applied only to planar graphs. Our algorithm constructs a Gomory-Hu tree for the given graph, providing a data "},"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":"1411.7055","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-11-25T22:23:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ce5149a36c9fff4c4793f9ba2e61300487d5f4fcd92da7fac462fda3acf328e3","abstract_canon_sha256":"009e0f8b34cf66f96e88110f81d508ed845d003b03f4613a2a05df4004a86e84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:50.853385Z","signature_b64":"J8apykUyUbXkfVGQ21loocavccqURLWaN8eH2ac1JWGQlwXFB+idhc57zona4u5DXgtE+dWDX9r/0MPr4SG8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12295661ca6c3fe03f8814923a9fa205b08e58b4792544d0b0a486f403ead913","last_reissued_at":"2026-05-18T01:23:50.852893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:50.852893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Amir Nayyeri, Christian Wulff-Nilsen, David Eppstein, Glencora Borradaile","submitted_at":"2014-11-25T22:23:14Z","abstract_excerpt":"For an undirected $n$-vertex 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 minimum $st$-cut in $G$? We solve this problem in preprocessing time $O(n\\log^3 n)$ for graphs of bounded genus, giving the first sub-quadratic time algorithm for this class of graphs. Our result also improves by a logarithmic factor a previous algorithm by Borradaile, Sankowski and Wulff-Nilsen (FOCS 2010) that applied only to planar graphs. Our algorithm constructs a Gomory-Hu tree for the given graph, providing a data "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7055","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":"1411.7055","created_at":"2026-05-18T01:23:50.852957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7055v2","created_at":"2026-05-18T01:23:50.852957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7055","created_at":"2026-05-18T01:23:50.852957+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIUVMYOKNQ76","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIUVMYOKNQ76AP4I","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIUVMYOK","created_at":"2026-05-18T12:28:22.404517+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/CIUVMYOKNQ76AP4ICSJDVH5CAW","json":"https://pith.science/pith/CIUVMYOKNQ76AP4ICSJDVH5CAW.json","graph_json":"https://pith.science/api/pith-number/CIUVMYOKNQ76AP4ICSJDVH5CAW/graph.json","events_json":"https://pith.science/api/pith-number/CIUVMYOKNQ76AP4ICSJDVH5CAW/events.json","paper":"https://pith.science/paper/CIUVMYOK"},"agent_actions":{"view_html":"https://pith.science/pith/CIUVMYOKNQ76AP4ICSJDVH5CAW","download_json":"https://pith.science/pith/CIUVMYOKNQ76AP4ICSJDVH5CAW.json","view_paper":"https://pith.science/paper/CIUVMYOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7055&json=true","fetch_graph":"https://pith.science/api/pith-number/CIUVMYOKNQ76AP4ICSJDVH5CAW/graph.json","fetch_events":"https://pith.science/api/pith-number/CIUVMYOKNQ76AP4ICSJDVH5CAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIUVMYOKNQ76AP4ICSJDVH5CAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIUVMYOKNQ76AP4ICSJDVH5CAW/action/storage_attestation","attest_author":"https://pith.science/pith/CIUVMYOKNQ76AP4ICSJDVH5CAW/action/author_attestation","sign_citation":"https://pith.science/pith/CIUVMYOKNQ76AP4ICSJDVH5CAW/action/citation_signature","submit_replication":"https://pith.science/pith/CIUVMYOKNQ76AP4ICSJDVH5CAW/action/replication_record"}},"created_at":"2026-05-18T01:23:50.852957+00:00","updated_at":"2026-05-18T01:23:50.852957+00:00"}