{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PQLQGITTPT5YWLNZWWV56BYAUN","short_pith_number":"pith:PQLQGITT","canonical_record":{"source":{"id":"1710.08488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-23T20:10:40Z","cross_cats_sorted":[],"title_canon_sha256":"6fabc46a074b36ad90bc726ff944aa039ef2263ce92de69f491f73ea4adc320f","abstract_canon_sha256":"9f82fd876bef97055aec5a948aeac3e85ee1ecb643eebabe1e2d60322fc8ce0c"},"schema_version":"1.0"},"canonical_sha256":"7c170322737cfb8b2db9b5abdf0700a34aa79e2ce2aef5c1aa9f72de9407d29a","source":{"kind":"arxiv","id":"1710.08488","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08488","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08488v1","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08488","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"PQLQGITTPT5Y","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PQLQGITTPT5YWLNZ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PQLQGITT","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PQLQGITTPT5YWLNZWWV56BYAUN","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-23T20:10:40Z","cross_cats_sorted":[],"title_canon_sha256":"6fabc46a074b36ad90bc726ff944aa039ef2263ce92de69f491f73ea4adc320f","abstract_canon_sha256":"9f82fd876bef97055aec5a948aeac3e85ee1ecb643eebabe1e2d60322fc8ce0c"},"schema_version":"1.0"},"canonical_sha256":"7c170322737cfb8b2db9b5abdf0700a34aa79e2ce2aef5c1aa9f72de9407d29a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:15.890122Z","signature_b64":"s7eOtmhSDvGmKs8VaqfNdfQjFZAgTjVLBihlW76lvkNhBDQhOQJI4oLPLmSvVRmjZnJTeGRLyfrvspLAIpxTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c170322737cfb8b2db9b5abdf0700a34aa79e2ce2aef5c1aa9f72de9407d29a","last_reissued_at":"2026-05-18T00:32:15.889333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:15.889333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08488","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-18T00:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VE8r4R6SMObBXVzRgk7y+CFfiZk33wwXIU916zITtm/MR0w/Puz7a3p+67feG5Y57+/8HVltgJOIn0FDttA7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:49:10.750698Z"},"content_sha256":"dabe962bd19b84f0f3a4cc0dcddaaca9718323e26176b65fc682fe65aeeab19a","schema_version":"1.0","event_id":"sha256:dabe962bd19b84f0f3a4cc0dcddaaca9718323e26176b65fc682fe65aeeab19a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PQLQGITTPT5YWLNZWWV56BYAUN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An FPT Algorithm Beating 2-Approximation for $k$-Cut","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":"2017-10-23T20:10:40Z","abstract_excerpt":"In the $k$-Cut problem, we are given an edge-weighted graph $G$ and an integer $k$, and have to remove a set of edges with minimum total weight so that $G$ has at least $k$ connected components. Prior work on this problem gives, for all $h \\in [2,k]$, a $(2-h/k)$-approximation algorithm for $k$-cut that runs in time $n^{O(h)}$. Hence to get a $(2 - \\varepsilon)$-approximation algorithm for some absolute constant $\\varepsilon$, the best runtime using prior techniques is $n^{O(k\\varepsilon)}$. Moreover, it was recently shown that getting a $(2 - \\varepsilon)$-approximation for general $k$ is NP-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08488","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-18T00:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtKlWKVKk5/H+rh7T39AlRlBXgQ9r5UT7dIFK+2l8WDeo73DUHomFd4WyvP18vfOhnX9yjcoGEYbT0LBMo6gBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:49:10.751442Z"},"content_sha256":"8f96c8e9eeb659f516f9dc6e97be951e6c303178dbac0f348099b0d914b0a563","schema_version":"1.0","event_id":"sha256:8f96c8e9eeb659f516f9dc6e97be951e6c303178dbac0f348099b0d914b0a563"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PQLQGITTPT5YWLNZWWV56BYAUN/bundle.json","state_url":"https://pith.science/pith/PQLQGITTPT5YWLNZWWV56BYAUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PQLQGITTPT5YWLNZWWV56BYAUN/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-10T02:49:10Z","links":{"resolver":"https://pith.science/pith/PQLQGITTPT5YWLNZWWV56BYAUN","bundle":"https://pith.science/pith/PQLQGITTPT5YWLNZWWV56BYAUN/bundle.json","state":"https://pith.science/pith/PQLQGITTPT5YWLNZWWV56BYAUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PQLQGITTPT5YWLNZWWV56BYAUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PQLQGITTPT5YWLNZWWV56BYAUN","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":"9f82fd876bef97055aec5a948aeac3e85ee1ecb643eebabe1e2d60322fc8ce0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-23T20:10:40Z","title_canon_sha256":"6fabc46a074b36ad90bc726ff944aa039ef2263ce92de69f491f73ea4adc320f"},"schema_version":"1.0","source":{"id":"1710.08488","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08488","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08488v1","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08488","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"PQLQGITTPT5Y","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PQLQGITTPT5YWLNZ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PQLQGITT","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:8f96c8e9eeb659f516f9dc6e97be951e6c303178dbac0f348099b0d914b0a563","target":"graph","created_at":"2026-05-18T00:32:15Z","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":"In the $k$-Cut problem, we are given an edge-weighted graph $G$ and an integer $k$, and have to remove a set of edges with minimum total weight so that $G$ has at least $k$ connected components. Prior work on this problem gives, for all $h \\in [2,k]$, a $(2-h/k)$-approximation algorithm for $k$-cut that runs in time $n^{O(h)}$. Hence to get a $(2 - \\varepsilon)$-approximation algorithm for some absolute constant $\\varepsilon$, the best runtime using prior techniques is $n^{O(k\\varepsilon)}$. Moreover, it was recently shown that getting a $(2 - \\varepsilon)$-approximation for general $k$ is NP-","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":"2017-10-23T20:10:40Z","title":"An FPT Algorithm Beating 2-Approximation for $k$-Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08488","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:dabe962bd19b84f0f3a4cc0dcddaaca9718323e26176b65fc682fe65aeeab19a","target":"record","created_at":"2026-05-18T00:32:15Z","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":"9f82fd876bef97055aec5a948aeac3e85ee1ecb643eebabe1e2d60322fc8ce0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-23T20:10:40Z","title_canon_sha256":"6fabc46a074b36ad90bc726ff944aa039ef2263ce92de69f491f73ea4adc320f"},"schema_version":"1.0","source":{"id":"1710.08488","kind":"arxiv","version":1}},"canonical_sha256":"7c170322737cfb8b2db9b5abdf0700a34aa79e2ce2aef5c1aa9f72de9407d29a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c170322737cfb8b2db9b5abdf0700a34aa79e2ce2aef5c1aa9f72de9407d29a","first_computed_at":"2026-05-18T00:32:15.889333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:15.889333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s7eOtmhSDvGmKs8VaqfNdfQjFZAgTjVLBihlW76lvkNhBDQhOQJI4oLPLmSvVRmjZnJTeGRLyfrvspLAIpxTBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:15.890122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08488","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dabe962bd19b84f0f3a4cc0dcddaaca9718323e26176b65fc682fe65aeeab19a","sha256:8f96c8e9eeb659f516f9dc6e97be951e6c303178dbac0f348099b0d914b0a563"],"state_sha256":"0b085bcc473539adce61d469f9393d31e0751c3cf149b3da1ad2444abe8f2ea6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wW0Uj3HNiGIdht3ncUvh0FuXMbdXf8AxnLeKFPmDh2xuKsNfZVORxMIJ9Em3O5fzSrGsxMPeAS9n7jBXVPiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T02:49:10.755797Z","bundle_sha256":"38874574a977b3e2e1b7096a61f74433a4947c670496525661f1f78abe399b40"}}