{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Y2MRQKBEDSMK4MJDY44ZOTOPC4","short_pith_number":"pith:Y2MRQKBE","schema_version":"1.0","canonical_sha256":"c6991828241c98ae3123c739974dcf172ebdee55ee1baef8dd000d108dc3526b","source":{"kind":"arxiv","id":"1207.4079","version":2},"attestation_state":"computed","paper":{"title":"Designing FPT algorithms for cut problems using randomized contractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk, MohammadTaghi Hajiaghayi, Rajesh Chitnis","submitted_at":"2012-07-17T18:24:13Z","abstract_excerpt":"We introduce a new technique for designing fixed-parameter algorithms for cut problems, namely randomized contractions. We apply our framework to obtain the first FPT algorithm for the Unique Label Cover problem and new FPT algorithms with exponential speed up for the Steiner Cut and Node Multiway Cut-Uncut problems. More precisely, we show the following:\n  - We prove that the parameterized version of the Unique Label Cover problem, which is the base of the Unique Games Conjecture, can be solved in 2^{O(k^2\\log |\\Sigma|)}n^4\\log n deterministic time (even in the stronger, vertex-deletion varia"},"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":"1207.4079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-17T18:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"2b097963293b0f1413c840d25309adc97d8d51ec7cc70e9c85978bf39e3c66fd","abstract_canon_sha256":"f8291e8874e6c30030a9bab0daad78fe5926c631210cfd6f5f127b0aea17d242"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:55.016416Z","signature_b64":"Og0HTLM2HY8AnqA3VRJveYrcpTz7vVSIZhJiYyjlMI4H4lD+Myy1lscuPekUVi5xPyF2uAf9FsMJIKSovaVqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6991828241c98ae3123c739974dcf172ebdee55ee1baef8dd000d108dc3526b","last_reissued_at":"2026-05-18T01:10:55.015790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:55.015790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Designing FPT algorithms for cut problems using randomized contractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk, MohammadTaghi Hajiaghayi, Rajesh Chitnis","submitted_at":"2012-07-17T18:24:13Z","abstract_excerpt":"We introduce a new technique for designing fixed-parameter algorithms for cut problems, namely randomized contractions. We apply our framework to obtain the first FPT algorithm for the Unique Label Cover problem and new FPT algorithms with exponential speed up for the Steiner Cut and Node Multiway Cut-Uncut problems. More precisely, we show the following:\n  - We prove that the parameterized version of the Unique Label Cover problem, which is the base of the Unique Games Conjecture, can be solved in 2^{O(k^2\\log |\\Sigma|)}n^4\\log n deterministic time (even in the stronger, vertex-deletion varia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4079","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.4079","created_at":"2026-05-18T01:10:55.015890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4079v2","created_at":"2026-05-18T01:10:55.015890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4079","created_at":"2026-05-18T01:10:55.015890+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2MRQKBEDSMK","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2MRQKBEDSMK4MJD","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2MRQKBE","created_at":"2026-05-18T12:27:27.928770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2511.15849","citing_title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y2MRQKBEDSMK4MJDY44ZOTOPC4","json":"https://pith.science/pith/Y2MRQKBEDSMK4MJDY44ZOTOPC4.json","graph_json":"https://pith.science/api/pith-number/Y2MRQKBEDSMK4MJDY44ZOTOPC4/graph.json","events_json":"https://pith.science/api/pith-number/Y2MRQKBEDSMK4MJDY44ZOTOPC4/events.json","paper":"https://pith.science/paper/Y2MRQKBE"},"agent_actions":{"view_html":"https://pith.science/pith/Y2MRQKBEDSMK4MJDY44ZOTOPC4","download_json":"https://pith.science/pith/Y2MRQKBEDSMK4MJDY44ZOTOPC4.json","view_paper":"https://pith.science/paper/Y2MRQKBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4079&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2MRQKBEDSMK4MJDY44ZOTOPC4/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2MRQKBEDSMK4MJDY44ZOTOPC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2MRQKBEDSMK4MJDY44ZOTOPC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2MRQKBEDSMK4MJDY44ZOTOPC4/action/storage_attestation","attest_author":"https://pith.science/pith/Y2MRQKBEDSMK4MJDY44ZOTOPC4/action/author_attestation","sign_citation":"https://pith.science/pith/Y2MRQKBEDSMK4MJDY44ZOTOPC4/action/citation_signature","submit_replication":"https://pith.science/pith/Y2MRQKBEDSMK4MJDY44ZOTOPC4/action/replication_record"}},"created_at":"2026-05-18T01:10:55.015890+00:00","updated_at":"2026-05-18T01:10:55.015890+00:00"}