{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZPASJOGMZ6HC3LDG6Q4YCMABLX","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":"bc5e37c39ec9818987e42bedbc985ee8d318984155329316c1c0661515055008","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-19T06:34:41Z","title_canon_sha256":"1ca25690c93f6dc0b4360c8d2d17473c3d77f77d122e3bd55e7087fe421c0717"},"schema_version":"1.0","source":{"id":"1411.5123","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5123","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5123v5","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5123","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"ZPASJOGMZ6HC","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZPASJOGMZ6HC3LDG","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZPASJOGM","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:db94354dee4654b3f0757f966214ba8f9ae1241397e88122dc7fe5b664928e66","target":"graph","created_at":"2026-05-18T00:02:14Z","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":"We present a deterministic near-linear time algorithm that computes the edge-connectivity and finds a minimum cut for a simple undirected unweighted graph G with n vertices and m edges. This is the first o(mn) time deterministic algorithm for the problem. In near-linear time we can also construct the classic cactus representation of all minimum cuts.\n  The previous fastest deterministic algorithm by Gabow from STOC'91 took ~O(m+k^2 n), where k is the edge connectivity, but k could be Omega(n).\n  At STOC'96 Karger presented a randomized near linear time Monte Carlo algorithm for the minimum cut","authors_text":"Ken-ichi Kawarabayashi, Mikkel Thorup","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-19T06:34:41Z","title":"Deterministic Edge Connectivity in Near-Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5123","kind":"arxiv","version":5},"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:a666f89bf6e48fbc6542a82daa6660762e3109ff193c0ee7870334893bbc1fbf","target":"record","created_at":"2026-05-18T00:02:14Z","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":"bc5e37c39ec9818987e42bedbc985ee8d318984155329316c1c0661515055008","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-19T06:34:41Z","title_canon_sha256":"1ca25690c93f6dc0b4360c8d2d17473c3d77f77d122e3bd55e7087fe421c0717"},"schema_version":"1.0","source":{"id":"1411.5123","kind":"arxiv","version":5}},"canonical_sha256":"cbc124b8cccf8e2dac66f4398130015df7e17b0703827068d79ba51411312c65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbc124b8cccf8e2dac66f4398130015df7e17b0703827068d79ba51411312c65","first_computed_at":"2026-05-18T00:02:14.002147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:14.002147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8+pVUzpcX2Mtz66bGQ2NmmiapWy58RVap7q2cahL3mw5aU9n63uWhZSOkaVJofxakjQ9cXgwNKCHxpL2u9v5CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:14.002921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.5123","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a666f89bf6e48fbc6542a82daa6660762e3109ff193c0ee7870334893bbc1fbf","sha256:db94354dee4654b3f0757f966214ba8f9ae1241397e88122dc7fe5b664928e66"],"state_sha256":"9a909c8cbf0440b30fe073d640624c93e71f849ac9b8f3fc3c87e7ff5b26657d"}