{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CIUVMYOKNQ76AP4ICSJDVH5CAW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"009e0f8b34cf66f96e88110f81d508ed845d003b03f4613a2a05df4004a86e84","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-11-25T22:23:14Z","title_canon_sha256":"ce5149a36c9fff4c4793f9ba2e61300487d5f4fcd92da7fac462fda3acf328e3"},"schema_version":"1.0","source":{"id":"1411.7055","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7055","created_at":"2026-05-18T01:23:50Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7055v2","created_at":"2026-05-18T01:23:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7055","created_at":"2026-05-18T01:23:50Z"},{"alias_kind":"pith_short_12","alias_value":"CIUVMYOKNQ76","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CIUVMYOKNQ76AP4I","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CIUVMYOK","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:dc36ae095197da2a03b90aa2d2b7656e7606ffc6c03ee8ab757b0e53418e0ec6","target":"graph","created_at":"2026-05-18T01:23:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Amir Nayyeri, Christian Wulff-Nilsen, David Eppstein, Glencora Borradaile","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-11-25T22:23:14Z","title":"All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7055","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:25c9e05544b8f2361d0d13a22c0ab11ad7db270a505b32b887f5530ed875f74d","target":"record","created_at":"2026-05-18T01:23:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"009e0f8b34cf66f96e88110f81d508ed845d003b03f4613a2a05df4004a86e84","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-11-25T22:23:14Z","title_canon_sha256":"ce5149a36c9fff4c4793f9ba2e61300487d5f4fcd92da7fac462fda3acf328e3"},"schema_version":"1.0","source":{"id":"1411.7055","kind":"arxiv","version":2}},"canonical_sha256":"12295661ca6c3fe03f8814923a9fa205b08e58b4792544d0b0a486f403ead913","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12295661ca6c3fe03f8814923a9fa205b08e58b4792544d0b0a486f403ead913","first_computed_at":"2026-05-18T01:23:50.852893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:50.852893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J8apykUyUbXkfVGQ21loocavccqURLWaN8eH2ac1JWGQlwXFB+idhc57zona4u5DXgtE+dWDX9r/0MPr4SG8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:50.853385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7055","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25c9e05544b8f2361d0d13a22c0ab11ad7db270a505b32b887f5530ed875f74d","sha256:dc36ae095197da2a03b90aa2d2b7656e7606ffc6c03ee8ab757b0e53418e0ec6"],"state_sha256":"afa911611010c358ab80f4850914eef22c3f6ad0e65dfa184a35af807aae0321"}