{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PR7VXDHLGY3CQ42C65ELLZAHI5","short_pith_number":"pith:PR7VXDHL","schema_version":"1.0","canonical_sha256":"7c7f5b8ceb3636287342f748b5e407475bcf3611b0e3789138e20f48eeb2f652","source":{"kind":"arxiv","id":"1509.05809","version":1},"attestation_state":"computed","paper":{"title":"Lower bounds for approximation schemes for Closest String","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk, Saket Saurabh","submitted_at":"2015-09-18T21:54:26Z","abstract_excerpt":"In the Closest String problem one is given a family $\\mathcal S$ of equal-length strings over some fixed alphabet, and the task is to find a string $y$ that minimizes the maximum Hamming distance between $y$ and a string from $\\mathcal S$. While polynomial-time approximation schemes (PTASes) for this problem are known for a long time [Li et al., J. ACM'02], no efficient polynomial-time approximation scheme (EPTAS) has been proposed so far. In this paper, we prove that the existence of an EPTAS for Closest String is in fact unlikely, as it would imply that $\\mathrm{FPT}=\\mathrm{W}[1]$, a highly"},"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":"1509.05809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-18T21:54:26Z","cross_cats_sorted":[],"title_canon_sha256":"0c4785f8105b7a710390fcfb157469db6410f9d0feb2d2c64ef719c30d78cde9","abstract_canon_sha256":"b6224a62f8c25ad63c7ade3022c274dc4c78082e08dc52bac82349abadf43b63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.261746Z","signature_b64":"78V+xYPWpWAkkJqQ6Uyiw8chosnbMpJ5RA41DY2KzIp5jxN6Y/Glx5XMsdvwca3boYCU8NVtoi1FylXY+tFMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c7f5b8ceb3636287342f748b5e407475bcf3611b0e3789138e20f48eeb2f652","last_reissued_at":"2026-05-18T01:32:42.261277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.261277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for approximation schemes for Closest String","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk, Saket Saurabh","submitted_at":"2015-09-18T21:54:26Z","abstract_excerpt":"In the Closest String problem one is given a family $\\mathcal S$ of equal-length strings over some fixed alphabet, and the task is to find a string $y$ that minimizes the maximum Hamming distance between $y$ and a string from $\\mathcal S$. While polynomial-time approximation schemes (PTASes) for this problem are known for a long time [Li et al., J. ACM'02], no efficient polynomial-time approximation scheme (EPTAS) has been proposed so far. In this paper, we prove that the existence of an EPTAS for Closest String is in fact unlikely, as it would imply that $\\mathrm{FPT}=\\mathrm{W}[1]$, a highly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05809","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":"1509.05809","created_at":"2026-05-18T01:32:42.261355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05809v1","created_at":"2026-05-18T01:32:42.261355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05809","created_at":"2026-05-18T01:32:42.261355+00:00"},{"alias_kind":"pith_short_12","alias_value":"PR7VXDHLGY3C","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PR7VXDHLGY3CQ42C","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PR7VXDHL","created_at":"2026-05-18T12:29:37.295048+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/PR7VXDHLGY3CQ42C65ELLZAHI5","json":"https://pith.science/pith/PR7VXDHLGY3CQ42C65ELLZAHI5.json","graph_json":"https://pith.science/api/pith-number/PR7VXDHLGY3CQ42C65ELLZAHI5/graph.json","events_json":"https://pith.science/api/pith-number/PR7VXDHLGY3CQ42C65ELLZAHI5/events.json","paper":"https://pith.science/paper/PR7VXDHL"},"agent_actions":{"view_html":"https://pith.science/pith/PR7VXDHLGY3CQ42C65ELLZAHI5","download_json":"https://pith.science/pith/PR7VXDHLGY3CQ42C65ELLZAHI5.json","view_paper":"https://pith.science/paper/PR7VXDHL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05809&json=true","fetch_graph":"https://pith.science/api/pith-number/PR7VXDHLGY3CQ42C65ELLZAHI5/graph.json","fetch_events":"https://pith.science/api/pith-number/PR7VXDHLGY3CQ42C65ELLZAHI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PR7VXDHLGY3CQ42C65ELLZAHI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PR7VXDHLGY3CQ42C65ELLZAHI5/action/storage_attestation","attest_author":"https://pith.science/pith/PR7VXDHLGY3CQ42C65ELLZAHI5/action/author_attestation","sign_citation":"https://pith.science/pith/PR7VXDHLGY3CQ42C65ELLZAHI5/action/citation_signature","submit_replication":"https://pith.science/pith/PR7VXDHLGY3CQ42C65ELLZAHI5/action/replication_record"}},"created_at":"2026-05-18T01:32:42.261355+00:00","updated_at":"2026-05-18T01:32:42.261355+00:00"}