{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IUP6FZMR3QPF6WWHE5F5CICWYN","short_pith_number":"pith:IUP6FZMR","schema_version":"1.0","canonical_sha256":"451fe2e591dc1e5f5ac7274bd12056c3517b4d2741ad89f985603b2bef457553","source":{"kind":"arxiv","id":"1107.1585","version":1},"attestation_state":"computed","paper":{"title":"On Multiway Cut parameterized above lower bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub Onufry Wojtaszczyk, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2011-07-08T09:29:43Z","abstract_excerpt":"In this paper we consider two above lower bound parameterizations of the Node Multiway Cut problem - above the maximum separating cut and above a natural LP-relaxation - and prove them to be fixed-parameter tractable. Our results imply O*(4^k) algorithms for Vertex Cover above Maximum Matching and Almost 2-SAT as well as an O*(2^k) algorithm for Node Multiway Cut with a standard parameterization by the solution size, improving previous bounds for these problems."},"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":"1107.1585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-08T09:29:43Z","cross_cats_sorted":[],"title_canon_sha256":"d0ce07573c5e622753979a3c9a63091d700a4cc4636de2cf808e93b816b47d3c","abstract_canon_sha256":"7346b9cb897f9eabc247c1ee8229d0b294c162d11d0105091a378d88149f2525"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:35.374807Z","signature_b64":"u5Snf+T3ZRzaQmOUQ9L81Vhn5giCYQwTz2TLwqVTwbNZupRjG16I8X3TeJue3GNKsyNjXXiOAdhv1gEvguzKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"451fe2e591dc1e5f5ac7274bd12056c3517b4d2741ad89f985603b2bef457553","last_reissued_at":"2026-05-18T04:18:35.374349Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:35.374349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Multiway Cut parameterized above lower bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub Onufry Wojtaszczyk, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2011-07-08T09:29:43Z","abstract_excerpt":"In this paper we consider two above lower bound parameterizations of the Node Multiway Cut problem - above the maximum separating cut and above a natural LP-relaxation - and prove them to be fixed-parameter tractable. Our results imply O*(4^k) algorithms for Vertex Cover above Maximum Matching and Almost 2-SAT as well as an O*(2^k) algorithm for Node Multiway Cut with a standard parameterization by the solution size, improving previous bounds for these problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1585","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.1585","created_at":"2026-05-18T04:18:35.374409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1585v1","created_at":"2026-05-18T04:18:35.374409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1585","created_at":"2026-05-18T04:18:35.374409+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUP6FZMR3QPF","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUP6FZMR3QPF6WWH","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUP6FZMR","created_at":"2026-05-18T12:26:32.869790+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/IUP6FZMR3QPF6WWHE5F5CICWYN","json":"https://pith.science/pith/IUP6FZMR3QPF6WWHE5F5CICWYN.json","graph_json":"https://pith.science/api/pith-number/IUP6FZMR3QPF6WWHE5F5CICWYN/graph.json","events_json":"https://pith.science/api/pith-number/IUP6FZMR3QPF6WWHE5F5CICWYN/events.json","paper":"https://pith.science/paper/IUP6FZMR"},"agent_actions":{"view_html":"https://pith.science/pith/IUP6FZMR3QPF6WWHE5F5CICWYN","download_json":"https://pith.science/pith/IUP6FZMR3QPF6WWHE5F5CICWYN.json","view_paper":"https://pith.science/paper/IUP6FZMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1585&json=true","fetch_graph":"https://pith.science/api/pith-number/IUP6FZMR3QPF6WWHE5F5CICWYN/graph.json","fetch_events":"https://pith.science/api/pith-number/IUP6FZMR3QPF6WWHE5F5CICWYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUP6FZMR3QPF6WWHE5F5CICWYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUP6FZMR3QPF6WWHE5F5CICWYN/action/storage_attestation","attest_author":"https://pith.science/pith/IUP6FZMR3QPF6WWHE5F5CICWYN/action/author_attestation","sign_citation":"https://pith.science/pith/IUP6FZMR3QPF6WWHE5F5CICWYN/action/citation_signature","submit_replication":"https://pith.science/pith/IUP6FZMR3QPF6WWHE5F5CICWYN/action/replication_record"}},"created_at":"2026-05-18T04:18:35.374409+00:00","updated_at":"2026-05-18T04:18:35.374409+00:00"}