{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PR7VXDHLGY3CQ42C65ELLZAHI5","short_pith_number":"pith:PR7VXDHL","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"},"canonical_sha256":"7c7f5b8ceb3636287342f748b5e407475bcf3611b0e3789138e20f48eeb2f652","source":{"kind":"arxiv","id":"1509.05809","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05809","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05809v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05809","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"PR7VXDHLGY3C","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PR7VXDHLGY3CQ42C","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PR7VXDHL","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PR7VXDHLGY3CQ42C65ELLZAHI5","target":"record","payload":{"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"},"canonical_sha256":"7c7f5b8ceb3636287342f748b5e407475bcf3611b0e3789138e20f48eeb2f652","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"},"source_kind":"arxiv","source_id":"1509.05809","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wywu16yUe9R0lM7yTQGhiszEZN96luAgG0eG9CNgF6P0rNbw00cGiiEA6P8Dyb8dHbzOk/neNASeJH4xxCSvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:30:29.864945Z"},"content_sha256":"c1f57d5042d7a38c2ff0fb9c7ac92efa49a4f159f41b621ffd6321c84f529e11","schema_version":"1.0","event_id":"sha256:c1f57d5042d7a38c2ff0fb9c7ac92efa49a4f159f41b621ffd6321c84f529e11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PR7VXDHLGY3CQ42C65ELLZAHI5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hwt9KkFCOR8jWJ+8Fx2IJBREddlRuYaoYXBZtdV+Yz2rnejoiA81hCFnxWVAqnAoHI1uDY6C0cWlp3ZF6b+6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:30:29.865728Z"},"content_sha256":"2158d2bab463fdc98682e33ecaa44ec24e13b10b2958d8d662c08d4a02f48152","schema_version":"1.0","event_id":"sha256:2158d2bab463fdc98682e33ecaa44ec24e13b10b2958d8d662c08d4a02f48152"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PR7VXDHLGY3CQ42C65ELLZAHI5/bundle.json","state_url":"https://pith.science/pith/PR7VXDHLGY3CQ42C65ELLZAHI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PR7VXDHLGY3CQ42C65ELLZAHI5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T08:30:29Z","links":{"resolver":"https://pith.science/pith/PR7VXDHLGY3CQ42C65ELLZAHI5","bundle":"https://pith.science/pith/PR7VXDHLGY3CQ42C65ELLZAHI5/bundle.json","state":"https://pith.science/pith/PR7VXDHLGY3CQ42C65ELLZAHI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PR7VXDHLGY3CQ42C65ELLZAHI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PR7VXDHLGY3CQ42C65ELLZAHI5","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":"b6224a62f8c25ad63c7ade3022c274dc4c78082e08dc52bac82349abadf43b63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-18T21:54:26Z","title_canon_sha256":"0c4785f8105b7a710390fcfb157469db6410f9d0feb2d2c64ef719c30d78cde9"},"schema_version":"1.0","source":{"id":"1509.05809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05809","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05809v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05809","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"PR7VXDHLGY3C","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PR7VXDHLGY3CQ42C","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PR7VXDHL","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:2158d2bab463fdc98682e33ecaa44ec24e13b10b2958d8d662c08d4a02f48152","target":"graph","created_at":"2026-05-18T01:32:42Z","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":"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","authors_text":"Daniel Lokshtanov, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk, Saket Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-18T21:54:26Z","title":"Lower bounds for approximation schemes for Closest String"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05809","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:c1f57d5042d7a38c2ff0fb9c7ac92efa49a4f159f41b621ffd6321c84f529e11","target":"record","created_at":"2026-05-18T01:32:42Z","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":"b6224a62f8c25ad63c7ade3022c274dc4c78082e08dc52bac82349abadf43b63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-18T21:54:26Z","title_canon_sha256":"0c4785f8105b7a710390fcfb157469db6410f9d0feb2d2c64ef719c30d78cde9"},"schema_version":"1.0","source":{"id":"1509.05809","kind":"arxiv","version":1}},"canonical_sha256":"7c7f5b8ceb3636287342f748b5e407475bcf3611b0e3789138e20f48eeb2f652","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c7f5b8ceb3636287342f748b5e407475bcf3611b0e3789138e20f48eeb2f652","first_computed_at":"2026-05-18T01:32:42.261277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:42.261277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"78V+xYPWpWAkkJqQ6Uyiw8chosnbMpJ5RA41DY2KzIp5jxN6Y/Glx5XMsdvwca3boYCU8NVtoi1FylXY+tFMBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:42.261746Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1f57d5042d7a38c2ff0fb9c7ac92efa49a4f159f41b621ffd6321c84f529e11","sha256:2158d2bab463fdc98682e33ecaa44ec24e13b10b2958d8d662c08d4a02f48152"],"state_sha256":"5710182ec59c3c78f042fe51100349768b8acf828c021ac317c93d2f64102cf2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j7Fs3+EtwT7Ys6URFqg9i27rtd0RGXNKctl4ni9/SwwfU4TRIouwYIaMgU4C5I+rLKMpGG+VTWGG8R7MCXfSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T08:30:29.869021Z","bundle_sha256":"907410d5debd26c6662517b4c1be6583af76ae24f77e031b9f6ad092955cd291"}}