{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:K7BIAB6H64HDWRXYG5DSVKSFRY","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":"5e5a332c6be8ccc692e71db1abc32794aa174a6a4f62c6560294907a1d2cf375","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-25T17:18:00Z","title_canon_sha256":"ef96b51a7fa668547302ebdebd6a90a968d256f712465300cc8d890b3771a4f6"},"schema_version":"1.0","source":{"id":"1010.5197","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5197","created_at":"2026-05-18T04:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5197v3","created_at":"2026-05-18T04:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5197","created_at":"2026-05-18T04:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"K7BIAB6H64HD","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"K7BIAB6H64HDWRXY","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"K7BIAB6H","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:896d773fd29a8d444acb0b338b747a37edc1a467e87d063c5ba60029cca60ed8","target":"graph","created_at":"2026-05-18T04:34:55Z","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":"Let $G=(V,E)$ be a graph on $n$ vertices and $R$ be a set of pairs of vertices in $V$ called \\emph{requests}. A \\emph{multicut} is a subset $F$ of $E$ such that every request $xy$ of $R$ is cut by $F$, \\i.e. every $xy$-path of $G$ intersects $F$. We show that there exists an $O(f(k)n^c)$ algorithm which decides if there exists a multicut of size at most $k$. In other words, the \\M{} problem parameterized by the solution size $k$ is Fixed-Parameter Tractable. The proof extends to vertex multicuts.","authors_text":"Jean Daligault, Nicolas Bousquet, St\\'ephan Thomass\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-25T17:18:00Z","title":"Multicut is FPT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5197","kind":"arxiv","version":3},"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:521b1b6cef367072d1371ecb217cf0d8b42b85d4ef971fdf98b2451f0b533c4a","target":"record","created_at":"2026-05-18T04:34:55Z","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":"5e5a332c6be8ccc692e71db1abc32794aa174a6a4f62c6560294907a1d2cf375","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-25T17:18:00Z","title_canon_sha256":"ef96b51a7fa668547302ebdebd6a90a968d256f712465300cc8d890b3771a4f6"},"schema_version":"1.0","source":{"id":"1010.5197","kind":"arxiv","version":3}},"canonical_sha256":"57c28007c7f70e3b46f837472aaa458e3d288c9ec5aab4b0f7effafd6ad3e576","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57c28007c7f70e3b46f837472aaa458e3d288c9ec5aab4b0f7effafd6ad3e576","first_computed_at":"2026-05-18T04:34:55.063647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:55.063647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"paDLAoToQO0DAGxbV+tDQtLsPrWlN4uuAIJ4Qmatbq5mU4UQs8VWISyvCECdZ4rIVw4F7ZEQOMTfG9yGDAs9Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:55.064033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5197","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:521b1b6cef367072d1371ecb217cf0d8b42b85d4ef971fdf98b2451f0b533c4a","sha256:896d773fd29a8d444acb0b338b747a37edc1a467e87d063c5ba60029cca60ed8"],"state_sha256":"58fe97b87d484783bee9945a1df55b7749b017e56ab0d517e265f9dc2280e69e"}