{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:K7BIAB6H64HDWRXYG5DSVKSFRY","short_pith_number":"pith:K7BIAB6H","schema_version":"1.0","canonical_sha256":"57c28007c7f70e3b46f837472aaa458e3d288c9ec5aab4b0f7effafd6ad3e576","source":{"kind":"arxiv","id":"1010.5197","version":3},"attestation_state":"computed","paper":{"title":"Multicut is FPT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jean Daligault, Nicolas Bousquet, St\\'ephan Thomass\\'e","submitted_at":"2010-10-25T17:18:00Z","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."},"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":"1010.5197","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-25T17:18:00Z","cross_cats_sorted":[],"title_canon_sha256":"ef96b51a7fa668547302ebdebd6a90a968d256f712465300cc8d890b3771a4f6","abstract_canon_sha256":"5e5a332c6be8ccc692e71db1abc32794aa174a6a4f62c6560294907a1d2cf375"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:55.064033Z","signature_b64":"paDLAoToQO0DAGxbV+tDQtLsPrWlN4uuAIJ4Qmatbq5mU4UQs8VWISyvCECdZ4rIVw4F7ZEQOMTfG9yGDAs9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57c28007c7f70e3b46f837472aaa458e3d288c9ec5aab4b0f7effafd6ad3e576","last_reissued_at":"2026-05-18T04:34:55.063647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:55.063647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multicut is FPT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jean Daligault, Nicolas Bousquet, St\\'ephan Thomass\\'e","submitted_at":"2010-10-25T17:18:00Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5197","kind":"arxiv","version":3},"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":"1010.5197","created_at":"2026-05-18T04:34:55.063710+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5197v3","created_at":"2026-05-18T04:34:55.063710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5197","created_at":"2026-05-18T04:34:55.063710+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7BIAB6H64HD","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7BIAB6H64HDWRXY","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7BIAB6H","created_at":"2026-05-18T12:26:09.077623+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/K7BIAB6H64HDWRXYG5DSVKSFRY","json":"https://pith.science/pith/K7BIAB6H64HDWRXYG5DSVKSFRY.json","graph_json":"https://pith.science/api/pith-number/K7BIAB6H64HDWRXYG5DSVKSFRY/graph.json","events_json":"https://pith.science/api/pith-number/K7BIAB6H64HDWRXYG5DSVKSFRY/events.json","paper":"https://pith.science/paper/K7BIAB6H"},"agent_actions":{"view_html":"https://pith.science/pith/K7BIAB6H64HDWRXYG5DSVKSFRY","download_json":"https://pith.science/pith/K7BIAB6H64HDWRXYG5DSVKSFRY.json","view_paper":"https://pith.science/paper/K7BIAB6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5197&json=true","fetch_graph":"https://pith.science/api/pith-number/K7BIAB6H64HDWRXYG5DSVKSFRY/graph.json","fetch_events":"https://pith.science/api/pith-number/K7BIAB6H64HDWRXYG5DSVKSFRY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7BIAB6H64HDWRXYG5DSVKSFRY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7BIAB6H64HDWRXYG5DSVKSFRY/action/storage_attestation","attest_author":"https://pith.science/pith/K7BIAB6H64HDWRXYG5DSVKSFRY/action/author_attestation","sign_citation":"https://pith.science/pith/K7BIAB6H64HDWRXYG5DSVKSFRY/action/citation_signature","submit_replication":"https://pith.science/pith/K7BIAB6H64HDWRXYG5DSVKSFRY/action/replication_record"}},"created_at":"2026-05-18T04:34:55.063710+00:00","updated_at":"2026-05-18T04:34:55.063710+00:00"}