{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZPASJOGMZ6HC3LDG6Q4YCMABLX","short_pith_number":"pith:ZPASJOGM","schema_version":"1.0","canonical_sha256":"cbc124b8cccf8e2dac66f4398130015df7e17b0703827068d79ba51411312c65","source":{"kind":"arxiv","id":"1411.5123","version":5},"attestation_state":"computed","paper":{"title":"Deterministic Edge Connectivity in Near-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ken-ichi Kawarabayashi, Mikkel Thorup","submitted_at":"2014-11-19T06:34:41Z","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"},"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.5123","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-19T06:34:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1ca25690c93f6dc0b4360c8d2d17473c3d77f77d122e3bd55e7087fe421c0717","abstract_canon_sha256":"bc5e37c39ec9818987e42bedbc985ee8d318984155329316c1c0661515055008"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:14.002921Z","signature_b64":"8+pVUzpcX2Mtz66bGQ2NmmiapWy58RVap7q2cahL3mw5aU9n63uWhZSOkaVJofxakjQ9cXgwNKCHxpL2u9v5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbc124b8cccf8e2dac66f4398130015df7e17b0703827068d79ba51411312c65","last_reissued_at":"2026-05-18T00:02:14.002147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:14.002147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Edge Connectivity in Near-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ken-ichi Kawarabayashi, Mikkel Thorup","submitted_at":"2014-11-19T06:34:41Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5123","kind":"arxiv","version":5},"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.5123","created_at":"2026-05-18T00:02:14.002267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.5123v5","created_at":"2026-05-18T00:02:14.002267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5123","created_at":"2026-05-18T00:02:14.002267+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPASJOGMZ6HC","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPASJOGMZ6HC3LDG","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPASJOGM","created_at":"2026-05-18T12:28:59.999130+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/ZPASJOGMZ6HC3LDG6Q4YCMABLX","json":"https://pith.science/pith/ZPASJOGMZ6HC3LDG6Q4YCMABLX.json","graph_json":"https://pith.science/api/pith-number/ZPASJOGMZ6HC3LDG6Q4YCMABLX/graph.json","events_json":"https://pith.science/api/pith-number/ZPASJOGMZ6HC3LDG6Q4YCMABLX/events.json","paper":"https://pith.science/paper/ZPASJOGM"},"agent_actions":{"view_html":"https://pith.science/pith/ZPASJOGMZ6HC3LDG6Q4YCMABLX","download_json":"https://pith.science/pith/ZPASJOGMZ6HC3LDG6Q4YCMABLX.json","view_paper":"https://pith.science/paper/ZPASJOGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.5123&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPASJOGMZ6HC3LDG6Q4YCMABLX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPASJOGMZ6HC3LDG6Q4YCMABLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPASJOGMZ6HC3LDG6Q4YCMABLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPASJOGMZ6HC3LDG6Q4YCMABLX/action/storage_attestation","attest_author":"https://pith.science/pith/ZPASJOGMZ6HC3LDG6Q4YCMABLX/action/author_attestation","sign_citation":"https://pith.science/pith/ZPASJOGMZ6HC3LDG6Q4YCMABLX/action/citation_signature","submit_replication":"https://pith.science/pith/ZPASJOGMZ6HC3LDG6Q4YCMABLX/action/replication_record"}},"created_at":"2026-05-18T00:02:14.002267+00:00","updated_at":"2026-05-18T00:02:14.002267+00:00"}