{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EGT7AGVTDBSOUFDY3P4H7FOGYR","short_pith_number":"pith:EGT7AGVT","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"},"canonical_sha256":"21a7f01ab31864ea1478dbf87f95c6c44aaaaae2a615a4658ace8bfaaf7589b7","source":{"kind":"arxiv","id":"1906.00417","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EGT7AGVTDBSOUFDY3P4H7FOGYR","target":"record","payload":{"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"},"canonical_sha256":"21a7f01ab31864ea1478dbf87f95c6c44aaaaae2a615a4658ace8bfaaf7589b7","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"},"source_kind":"arxiv","source_id":"1906.00417","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"26qzBLtM9u8a2bMqQYRWyzRecGwykkbhxhuCgcfL0WLzye9ey64Mar93riHSL7GFm0hnyuuAkQINbP9f43akAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:08:57.943492Z"},"content_sha256":"4982b8a338003547cf398eaf471e56824e37123ebda1d79db0248cbcfd9726fb","schema_version":"1.0","event_id":"sha256:4982b8a338003547cf398eaf471e56824e37123ebda1d79db0248cbcfd9726fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EGT7AGVTDBSOUFDY3P4H7FOGYR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U9i5ic/eTyFb6X6oXTfUzI6zNb4HTJDIVOwhSrtZJYYzAMYAnoFsTTKyo1SPsRWPS/OFZWnUq8r7aavptgzxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:08:57.944159Z"},"content_sha256":"c6d87512286872b240c80cac537677ed57eb5217e9a01817d8c89af0b560278d","schema_version":"1.0","event_id":"sha256:c6d87512286872b240c80cac537677ed57eb5217e9a01817d8c89af0b560278d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR/bundle.json","state_url":"https://pith.science/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T15:08:57Z","links":{"resolver":"https://pith.science/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR","bundle":"https://pith.science/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR/bundle.json","state":"https://pith.science/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EGT7AGVTDBSOUFDY3P4H7FOGYR/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/TFlx2foss+wekdiVhVkLGSHdp+IulZNWJUk0/duuXxAY2T9lSC53Hdw78QEwh93X1Ef4sKR4DuBzT6ET7HDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T15:08:57.947329Z","bundle_sha256":"9be86cd391525da39441954c32faf1a4945f77f0ab1c83758350eea059361840"}}