{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SXR7ONYYPU3WVKDBUIFM4SCRAV","short_pith_number":"pith:SXR7ONYY","schema_version":"1.0","canonical_sha256":"95e3f737187d376aa861a20ace4851054a03d84073d10606e46fe6a57fb115c5","source":{"kind":"arxiv","id":"1905.06503","version":2},"attestation_state":"computed","paper":{"title":"Parameterized Inapproximability of Exact Cover and Nearest Codeword","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Patrick Lin, Venkatesan Guruswami","submitted_at":"2019-05-16T02:28:14Z","abstract_excerpt":"The $k$-ExactCover problem is a parameterized version of the ExactCover problem, in which we are given a universe $U$, a collection $S$ of subsets of $U$, and an integer $k$, and the task is to determine whether $U$ can be partitioned into $k$ sets in $S$. This is a natural extension of the well-studied SetCover problem; though in the parameterized regime we know it to be $W[1]$-complete in the exact case, its parameterized complexity with respect to approximability is not well understood.\n  We prove that, assuming ETH, for some $\\gamma > 0$ there is no time $f(k) \\cdot N^{\\gamma k}$ algorithm"},"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":"1905.06503","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-16T02:28:14Z","cross_cats_sorted":[],"title_canon_sha256":"62b885c1b813133edcbc4918872ab2dec3d51a8b2c4aa2ab69d7dd4f6fe2a530","abstract_canon_sha256":"8526df87acb1a1754597de8bbee325233a9363533b00cabed09cd0bc205e4b83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:51.493430Z","signature_b64":"jYfIHXdrMWDnuDR/uCqxnmzhgdhtnJJGuCQ7cw1073841tHHMSs5UPEZMP7bB30A0ItfnGoveYMztndQuk4zAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95e3f737187d376aa861a20ace4851054a03d84073d10606e46fe6a57fb115c5","last_reissued_at":"2026-05-17T23:45:51.493047Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:51.493047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Inapproximability of Exact Cover and Nearest Codeword","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Patrick Lin, Venkatesan Guruswami","submitted_at":"2019-05-16T02:28:14Z","abstract_excerpt":"The $k$-ExactCover problem is a parameterized version of the ExactCover problem, in which we are given a universe $U$, a collection $S$ of subsets of $U$, and an integer $k$, and the task is to determine whether $U$ can be partitioned into $k$ sets in $S$. This is a natural extension of the well-studied SetCover problem; though in the parameterized regime we know it to be $W[1]$-complete in the exact case, its parameterized complexity with respect to approximability is not well understood.\n  We prove that, assuming ETH, for some $\\gamma > 0$ there is no time $f(k) \\cdot N^{\\gamma k}$ algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06503","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":"1905.06503","created_at":"2026-05-17T23:45:51.493105+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.06503v2","created_at":"2026-05-17T23:45:51.493105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06503","created_at":"2026-05-17T23:45:51.493105+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXR7ONYYPU3W","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXR7ONYYPU3WVKDB","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXR7ONYY","created_at":"2026-05-18T12:33:27.125529+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/SXR7ONYYPU3WVKDBUIFM4SCRAV","json":"https://pith.science/pith/SXR7ONYYPU3WVKDBUIFM4SCRAV.json","graph_json":"https://pith.science/api/pith-number/SXR7ONYYPU3WVKDBUIFM4SCRAV/graph.json","events_json":"https://pith.science/api/pith-number/SXR7ONYYPU3WVKDBUIFM4SCRAV/events.json","paper":"https://pith.science/paper/SXR7ONYY"},"agent_actions":{"view_html":"https://pith.science/pith/SXR7ONYYPU3WVKDBUIFM4SCRAV","download_json":"https://pith.science/pith/SXR7ONYYPU3WVKDBUIFM4SCRAV.json","view_paper":"https://pith.science/paper/SXR7ONYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.06503&json=true","fetch_graph":"https://pith.science/api/pith-number/SXR7ONYYPU3WVKDBUIFM4SCRAV/graph.json","fetch_events":"https://pith.science/api/pith-number/SXR7ONYYPU3WVKDBUIFM4SCRAV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXR7ONYYPU3WVKDBUIFM4SCRAV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXR7ONYYPU3WVKDBUIFM4SCRAV/action/storage_attestation","attest_author":"https://pith.science/pith/SXR7ONYYPU3WVKDBUIFM4SCRAV/action/author_attestation","sign_citation":"https://pith.science/pith/SXR7ONYYPU3WVKDBUIFM4SCRAV/action/citation_signature","submit_replication":"https://pith.science/pith/SXR7ONYYPU3WVKDBUIFM4SCRAV/action/replication_record"}},"created_at":"2026-05-17T23:45:51.493105+00:00","updated_at":"2026-05-17T23:45:51.493105+00:00"}