{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:R2D3YFMWZGXJNVQ3YVV6ABBVWN","short_pith_number":"pith:R2D3YFMW","schema_version":"1.0","canonical_sha256":"8e87bc1596c9ae96d61bc56be00435b35f86210d96c6a0a6507b535d93b158f9","source":{"kind":"arxiv","id":"2404.08870","version":2},"attestation_state":"computed","paper":{"title":"Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bingkai Lin, Kewen Wu, Venkatesan Guruswami, Xuandi Ren, Yican Sun","submitted_at":"2024-04-13T01:45:44Z","abstract_excerpt":"The Parameterized Inapproximability Hypothesis (PIH), which is an analog of the PCP theorem in parameterized complexity, asserts that, there is a constant $\\varepsilon> 0$ such that for any computable function $f:\\mathbb{N}\\to\\mathbb{N}$, no $f(k)\\cdot n^{O(1)}$-time algorithm can, on input a $k$-variable CSP instance with domain size $n$, find an assignment satisfying $1-\\varepsilon$ fraction of the constraints. A recent work by Guruswami, Lin, Ren, Sun, and Wu (STOC'24) established PIH under the Exponential Time Hypothesis (ETH).\n  In this work, we improve the quantitative aspects of PIH and"},"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":"2404.08870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-04-13T01:45:44Z","cross_cats_sorted":[],"title_canon_sha256":"12294c1fb13cde66cfac091bc9cb77468bb92de3e86718cbf7d9384be6290689","abstract_canon_sha256":"0da50b6f1b8dd5e1be5ef88cceaa4e504b893eae5f5cc5e1adb78acda87461a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:30:32.904164Z","signature_b64":"w3RKGW+Ue+5KlOqlDXbczt579tg4QKJ+Dx3MpackUXXnKJFlRtj/MHsg0mmgeUW0NHVVvx33l5YTJzSakSUlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e87bc1596c9ae96d61bc56be00435b35f86210d96c6a0a6507b535d93b158f9","last_reissued_at":"2026-07-05T08:30:32.903607Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:30:32.903607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bingkai Lin, Kewen Wu, Venkatesan Guruswami, Xuandi Ren, Yican Sun","submitted_at":"2024-04-13T01:45:44Z","abstract_excerpt":"The Parameterized Inapproximability Hypothesis (PIH), which is an analog of the PCP theorem in parameterized complexity, asserts that, there is a constant $\\varepsilon> 0$ such that for any computable function $f:\\mathbb{N}\\to\\mathbb{N}$, no $f(k)\\cdot n^{O(1)}$-time algorithm can, on input a $k$-variable CSP instance with domain size $n$, find an assignment satisfying $1-\\varepsilon$ fraction of the constraints. A recent work by Guruswami, Lin, Ren, Sun, and Wu (STOC'24) established PIH under the Exponential Time Hypothesis (ETH).\n  In this work, we improve the quantitative aspects of PIH and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.08870","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.08870/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.08870","created_at":"2026-07-05T08:30:32.903669+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.08870v2","created_at":"2026-07-05T08:30:32.903669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.08870","created_at":"2026-07-05T08:30:32.903669+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2D3YFMWZGXJ","created_at":"2026-07-05T08:30:32.903669+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2D3YFMWZGXJNVQ3","created_at":"2026-07-05T08:30:32.903669+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2D3YFMW","created_at":"2026-07-05T08:30:32.903669+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.10369","citing_title":"Optimal FPT-Approximability for Modular Linear Equations","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R2D3YFMWZGXJNVQ3YVV6ABBVWN","json":"https://pith.science/pith/R2D3YFMWZGXJNVQ3YVV6ABBVWN.json","graph_json":"https://pith.science/api/pith-number/R2D3YFMWZGXJNVQ3YVV6ABBVWN/graph.json","events_json":"https://pith.science/api/pith-number/R2D3YFMWZGXJNVQ3YVV6ABBVWN/events.json","paper":"https://pith.science/paper/R2D3YFMW"},"agent_actions":{"view_html":"https://pith.science/pith/R2D3YFMWZGXJNVQ3YVV6ABBVWN","download_json":"https://pith.science/pith/R2D3YFMWZGXJNVQ3YVV6ABBVWN.json","view_paper":"https://pith.science/paper/R2D3YFMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.08870&json=true","fetch_graph":"https://pith.science/api/pith-number/R2D3YFMWZGXJNVQ3YVV6ABBVWN/graph.json","fetch_events":"https://pith.science/api/pith-number/R2D3YFMWZGXJNVQ3YVV6ABBVWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2D3YFMWZGXJNVQ3YVV6ABBVWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2D3YFMWZGXJNVQ3YVV6ABBVWN/action/storage_attestation","attest_author":"https://pith.science/pith/R2D3YFMWZGXJNVQ3YVV6ABBVWN/action/author_attestation","sign_citation":"https://pith.science/pith/R2D3YFMWZGXJNVQ3YVV6ABBVWN/action/citation_signature","submit_replication":"https://pith.science/pith/R2D3YFMWZGXJNVQ3YVV6ABBVWN/action/replication_record"}},"created_at":"2026-07-05T08:30:32.903669+00:00","updated_at":"2026-07-05T08:30:32.903669+00:00"}