{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EGT7AGVTDBSOUFDY3P4H7FOGYR","short_pith_number":"pith:EGT7AGVT","schema_version":"1.0","canonical_sha256":"21a7f01ab31864ea1478dbf87f95c6c44aaaaae2a615a4658ace8bfaaf7589b7","source":{"kind":"arxiv","id":"1906.00417","version":1},"attestation_state":"computed","paper":{"title":"The Number of Minimum $k$-Cuts: Improving the Karger-Stein Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Euiwoong Lee, Jason Li","submitted_at":"2019-06-02T14:59:12Z","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"},"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":"1906.00417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-02T14:59:12Z","cross_cats_sorted":[],"title_canon_sha256":"58f27c70159c193a981a5d7dfdea710ca6ba11c91580977be9ccc8298aa63ee4","abstract_canon_sha256":"2117e54ca08b58199090be162dc74b2b7a4d550bf9553ef8747ed540a4478358"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:27.139181Z","signature_b64":"yh2Dz8jBrq0ZDHgt0FLSXWrXymO0pyR9Ho0pT/lDgjQZlIuviET+0B/19IrjKgwyz53LPQVNAykmFBmoS9yKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21a7f01ab31864ea1478dbf87f95c6c44aaaaae2a615a4658ace8bfaaf7589b7","last_reissued_at":"2026-05-17T23:44:27.138560Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:27.138560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Number of Minimum $k$-Cuts: Improving the Karger-Stein Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Euiwoong Lee, Jason Li","submitted_at":"2019-06-02T14:59:12Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00417","kind":"arxiv","version":1},"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":"1906.00417","created_at":"2026-05-17T23:44:27.138668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00417v1","created_at":"2026-05-17T23:44:27.138668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00417","created_at":"2026-05-17T23:44:27.138668+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGT7AGVTDBSO","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGT7AGVTDBSOUFDY","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGT7AGVT","created_at":"2026-05-18T12:33:15.570797+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/EGT7AGVTDBSOUFDY3P4H7FOGYR","json":"https://pith.science/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR.json","graph_json":"https://pith.science/api/pith-number/EGT7AGVTDBSOUFDY3P4H7FOGYR/graph.json","events_json":"https://pith.science/api/pith-number/EGT7AGVTDBSOUFDY3P4H7FOGYR/events.json","paper":"https://pith.science/paper/EGT7AGVT"},"agent_actions":{"view_html":"https://pith.science/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR","download_json":"https://pith.science/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR.json","view_paper":"https://pith.science/paper/EGT7AGVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00417&json=true","fetch_graph":"https://pith.science/api/pith-number/EGT7AGVTDBSOUFDY3P4H7FOGYR/graph.json","fetch_events":"https://pith.science/api/pith-number/EGT7AGVTDBSOUFDY3P4H7FOGYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR/action/storage_attestation","attest_author":"https://pith.science/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR/action/author_attestation","sign_citation":"https://pith.science/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR/action/citation_signature","submit_replication":"https://pith.science/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR/action/replication_record"}},"created_at":"2026-05-17T23:44:27.138668+00:00","updated_at":"2026-05-17T23:44:27.138668+00:00"}