{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:S2THZY32OGCUT3ZUADWJCNNULQ","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":"dc3acf4e1cc2b74c665a003873d1e3b71922a214f8a100d71eb5441260ebe260","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-26T12:16:44Z","title_canon_sha256":"48fd00c692ae039b285b25c20df2a4e1e0dbf7ae214a56b619b9ef42ba29c751"},"schema_version":"1.0","source":{"id":"1202.5749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5749","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5749v1","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5749","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"S2THZY32OGCU","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S2THZY32OGCUT3ZU","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S2THZY32","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:70ceb7c29b6935e4426b8570fbb935b515f3158bc3756cd507f753b8822f0e38","target":"graph","created_at":"2026-05-18T04:01:24Z","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":"The MULTICUT problem, given a graph G, a set of terminal pairs T={(s_i,t_i) | 1 <= i <= r} and an integer p, asks whether one can find a cutset consisting of at most p non-terminal vertices that separates all the terminal pairs, i.e., after removing the cutset, t_i is not reachable from s_i for each 1 <= i <= r. The fixed-parameter tractability of MULTICUT in undirected graphs, parameterized by the size of the cutset only, has been recently proven by Marx and Razgon (STOC'11) and, independently, by Bousquet et al. (STOC'11), after resisting attacks as a long-standing open problem. In this pape","authors_text":"Magnus Wahlstr\\\"om, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Stefan Kratsch","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-26T12:16:44Z","title":"Fixed-parameter tractability of multicut in directed acyclic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5749","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:3080892ed7e2c68daac0c13b3bb4edd40aa5ed887295c27bd1b4667bac627050","target":"record","created_at":"2026-05-18T04:01:24Z","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":"dc3acf4e1cc2b74c665a003873d1e3b71922a214f8a100d71eb5441260ebe260","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-26T12:16:44Z","title_canon_sha256":"48fd00c692ae039b285b25c20df2a4e1e0dbf7ae214a56b619b9ef42ba29c751"},"schema_version":"1.0","source":{"id":"1202.5749","kind":"arxiv","version":1}},"canonical_sha256":"96a67ce37a718549ef3400ec9135b45c17f1a1f72ff89f18d0aa6f6db97b853b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96a67ce37a718549ef3400ec9135b45c17f1a1f72ff89f18d0aa6f6db97b853b","first_computed_at":"2026-05-18T04:01:24.774806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:24.774806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XUANyfgDYGIT3d3cYTBtZNMJG8+P0fh5QzUI90Gy4cyEy6XbPivd25j8I9f3Kg/kq+QEeM7boSnRn+1jTGXADA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:24.775550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3080892ed7e2c68daac0c13b3bb4edd40aa5ed887295c27bd1b4667bac627050","sha256:70ceb7c29b6935e4426b8570fbb935b515f3158bc3756cd507f753b8822f0e38"],"state_sha256":"5daee7ad6d11937345311562f8f46bff7cf2d1ecc591f7a54f01c36610a23ba1"}