{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EGT7AGVTDBSOUFDY3P4H7FOGYR","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":"2117e54ca08b58199090be162dc74b2b7a4d550bf9553ef8747ed540a4478358","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-02T14:59:12Z","title_canon_sha256":"58f27c70159c193a981a5d7dfdea710ca6ba11c91580977be9ccc8298aa63ee4"},"schema_version":"1.0","source":{"id":"1906.00417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00417","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00417v1","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00417","created_at":"2026-05-17T23:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"EGT7AGVTDBSO","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EGT7AGVTDBSOUFDY","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EGT7AGVT","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:c6d87512286872b240c80cac537677ed57eb5217e9a01817d8c89af0b560278d","target":"graph","created_at":"2026-05-17T23:44:27Z","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":"Given an edge-weighted graph, how many minimum $k$-cuts can it have? This is a fundamental question in the intersection of algorithms, extremal combinatorics, and graph theory. It is particularly interesting in that the best known bounds are algorithmic: they stem from algorithms that compute the minimum $k$-cut.\n  In 1994, Karger and Stein obtained a randomized contraction algorithm that finds a minimum $k$-cut in $O(n^{(2-o(1))k})$ time. It can also enumerate all such $k$-cuts in the same running time, establishing a corresponding extremal bound of $O(n^{(2-o(1))k})$. Since then, the algorit","authors_text":"Anupam Gupta, Euiwoong Lee, Jason Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-02T14:59:12Z","title":"The Number of Minimum $k$-Cuts: Improving the Karger-Stein Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00417","kind":"arxiv","version":1},"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:4982b8a338003547cf398eaf471e56824e37123ebda1d79db0248cbcfd9726fb","target":"record","created_at":"2026-05-17T23:44:27Z","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":"2117e54ca08b58199090be162dc74b2b7a4d550bf9553ef8747ed540a4478358","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-02T14:59:12Z","title_canon_sha256":"58f27c70159c193a981a5d7dfdea710ca6ba11c91580977be9ccc8298aa63ee4"},"schema_version":"1.0","source":{"id":"1906.00417","kind":"arxiv","version":1}},"canonical_sha256":"21a7f01ab31864ea1478dbf87f95c6c44aaaaae2a615a4658ace8bfaaf7589b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21a7f01ab31864ea1478dbf87f95c6c44aaaaae2a615a4658ace8bfaaf7589b7","first_computed_at":"2026-05-17T23:44:27.138560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:27.138560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yh2Dz8jBrq0ZDHgt0FLSXWrXymO0pyR9Ho0pT/lDgjQZlIuviET+0B/19IrjKgwyz53LPQVNAykmFBmoS9yKBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:27.139181Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4982b8a338003547cf398eaf471e56824e37123ebda1d79db0248cbcfd9726fb","sha256:c6d87512286872b240c80cac537677ed57eb5217e9a01817d8c89af0b560278d"],"state_sha256":"5b9d032437c96779c9f2549765af827e544d1c92321d077f512d19f7695df8c4"}