{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NQPZXGPM5CX5U36UWHLE2W7F6B","short_pith_number":"pith:NQPZXGPM","canonical_record":{"source":{"id":"1101.4689","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-24T23:48:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"904e0c50403501ea6b7bb067071961f749e001e2357dea07995dbd660bfb3e3e","abstract_canon_sha256":"b23596ade3d70066bf4e693061d43776459fea5bf972ef0a8b181d38f9cc2426"},"schema_version":"1.0"},"canonical_sha256":"6c1f9b99ece8afda6fd4b1d64d5be5f04d76c2bb797ceed4ddc106d33469f3d4","source":{"kind":"arxiv","id":"1101.4689","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4689","created_at":"2026-05-18T04:30:47Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4689v2","created_at":"2026-05-18T04:30:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4689","created_at":"2026-05-18T04:30:47Z"},{"alias_kind":"pith_short_12","alias_value":"NQPZXGPM5CX5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NQPZXGPM5CX5U36U","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NQPZXGPM","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NQPZXGPM5CX5U36UWHLE2W7F6B","target":"record","payload":{"canonical_record":{"source":{"id":"1101.4689","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-24T23:48:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"904e0c50403501ea6b7bb067071961f749e001e2357dea07995dbd660bfb3e3e","abstract_canon_sha256":"b23596ade3d70066bf4e693061d43776459fea5bf972ef0a8b181d38f9cc2426"},"schema_version":"1.0"},"canonical_sha256":"6c1f9b99ece8afda6fd4b1d64d5be5f04d76c2bb797ceed4ddc106d33469f3d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:47.130417Z","signature_b64":"tel4Trw1xOIZNqpO+cRYfDsfU2hXuykQdEj2NOySMlSZqQqHgU5JsCUTD1a29Jg6pL9rCSkFE5uoZZjh3vCuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c1f9b99ece8afda6fd4b1d64d5be5f04d76c2bb797ceed4ddc106d33469f3d4","last_reissued_at":"2026-05-18T04:30:47.129937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:47.129937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.4689","source_version":2,"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-18T04:30:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SYDFbNgmONHXwz2HDapupaZNjRQQN4n3v3tn0Pr41wg6dgFyLV8Ug0FEIibeTusIkKtnsUpKvuhdp4vgNDnpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:10:19.830590Z"},"content_sha256":"709c8277cb0ffc3bbda5be7fb7c88ee9f718a8e06a14b111262f987ec4a639ba","schema_version":"1.0","event_id":"sha256:709c8277cb0ffc3bbda5be7fb7c88ee9f718a8e06a14b111262f987ec4a639ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NQPZXGPM5CX5U36UWHLE2W7F6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum k-way cut of bounded size is fixed-parameter tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ken-ichi Kawarabayashi, Mikkel Thorup","submitted_at":"2011-01-24T23:48:50Z","abstract_excerpt":"We consider a the minimum k-way cut problem for unweighted graphs with a size bound s on the number of cut edges allowed. Thus we seek to remove as few edges as possible so as to split a graph into k components, or report that this requires cutting more than s edges. We show that this problem is fixed-parameter tractable (FPT) in s. More precisely, for s=O(1), our algorithm runs in quadratic time while we have a different linear time algorithm for planar graphs and bounded genus graphs. Our tractability result stands in contrast to known W[1] hardness of related problems. Without the size boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4689","kind":"arxiv","version":2},"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-18T04:30:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KmSm1dt2HRAGUqZNbDC6uhX1QXj/dWCJ6JPMbdsgiRw7uBQkdvBIxX6kuaReKCcQ9B+mU4u/HjXKk7qt/mSaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:10:19.830940Z"},"content_sha256":"c4d402872a968d37225524d27f57b2d603a08d0b8e23f7e4cd1606296d4126b1","schema_version":"1.0","event_id":"sha256:c4d402872a968d37225524d27f57b2d603a08d0b8e23f7e4cd1606296d4126b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQPZXGPM5CX5U36UWHLE2W7F6B/bundle.json","state_url":"https://pith.science/pith/NQPZXGPM5CX5U36UWHLE2W7F6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQPZXGPM5CX5U36UWHLE2W7F6B/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-02T22:10:19Z","links":{"resolver":"https://pith.science/pith/NQPZXGPM5CX5U36UWHLE2W7F6B","bundle":"https://pith.science/pith/NQPZXGPM5CX5U36UWHLE2W7F6B/bundle.json","state":"https://pith.science/pith/NQPZXGPM5CX5U36UWHLE2W7F6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQPZXGPM5CX5U36UWHLE2W7F6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NQPZXGPM5CX5U36UWHLE2W7F6B","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":"b23596ade3d70066bf4e693061d43776459fea5bf972ef0a8b181d38f9cc2426","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-24T23:48:50Z","title_canon_sha256":"904e0c50403501ea6b7bb067071961f749e001e2357dea07995dbd660bfb3e3e"},"schema_version":"1.0","source":{"id":"1101.4689","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4689","created_at":"2026-05-18T04:30:47Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4689v2","created_at":"2026-05-18T04:30:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4689","created_at":"2026-05-18T04:30:47Z"},{"alias_kind":"pith_short_12","alias_value":"NQPZXGPM5CX5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NQPZXGPM5CX5U36U","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NQPZXGPM","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:c4d402872a968d37225524d27f57b2d603a08d0b8e23f7e4cd1606296d4126b1","target":"graph","created_at":"2026-05-18T04:30:47Z","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":"We consider a the minimum k-way cut problem for unweighted graphs with a size bound s on the number of cut edges allowed. Thus we seek to remove as few edges as possible so as to split a graph into k components, or report that this requires cutting more than s edges. We show that this problem is fixed-parameter tractable (FPT) in s. More precisely, for s=O(1), our algorithm runs in quadratic time while we have a different linear time algorithm for planar graphs and bounded genus graphs. Our tractability result stands in contrast to known W[1] hardness of related problems. Without the size boun","authors_text":"Ken-ichi Kawarabayashi, Mikkel Thorup","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-24T23:48:50Z","title":"Minimum k-way cut of bounded size is fixed-parameter tractable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4689","kind":"arxiv","version":2},"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:709c8277cb0ffc3bbda5be7fb7c88ee9f718a8e06a14b111262f987ec4a639ba","target":"record","created_at":"2026-05-18T04:30:47Z","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":"b23596ade3d70066bf4e693061d43776459fea5bf972ef0a8b181d38f9cc2426","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-24T23:48:50Z","title_canon_sha256":"904e0c50403501ea6b7bb067071961f749e001e2357dea07995dbd660bfb3e3e"},"schema_version":"1.0","source":{"id":"1101.4689","kind":"arxiv","version":2}},"canonical_sha256":"6c1f9b99ece8afda6fd4b1d64d5be5f04d76c2bb797ceed4ddc106d33469f3d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c1f9b99ece8afda6fd4b1d64d5be5f04d76c2bb797ceed4ddc106d33469f3d4","first_computed_at":"2026-05-18T04:30:47.129937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:30:47.129937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tel4Trw1xOIZNqpO+cRYfDsfU2hXuykQdEj2NOySMlSZqQqHgU5JsCUTD1a29Jg6pL9rCSkFE5uoZZjh3vCuBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:30:47.130417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4689","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:709c8277cb0ffc3bbda5be7fb7c88ee9f718a8e06a14b111262f987ec4a639ba","sha256:c4d402872a968d37225524d27f57b2d603a08d0b8e23f7e4cd1606296d4126b1"],"state_sha256":"cbe5a54e9ece351d21f06618df833b15ef1f2e6b49860f2ca86199c5009f3746"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nu7IZFIKWIV2x+LyqD45osTJT3g4RLSsl1gczTtBRAuX/IhiuL3w90ygilTwI8spW6dDSz11etZWx4gXnNRxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:10:19.833047Z","bundle_sha256":"3f7b1406c7afe9e72c45f2e8f658e1461604b0ea8a302ac74c23712f3ce517d6"}}