{"schema_version":"source-reader-v1","record":{"source_id":"pnp-seth","versions":[{"work":{"authors":["Marek Cygan","Holger Dell","Daniel Lokshtanov","Dániel Marx","Jesper Nederlof","Yoshio Okamoto","Ramamohan Paturi","Saket Saurabh","Magnus Wahlström"],"kind":"research_paper","publication":"preprint","publication_note":"Author full version dated March 2014; an extended abstract appeared at CCC 2012. The paper explicitly uses a bounded-error randomized formulation of SETH.","ai_role":"not_reported","ai_note":"AI involvement is not reported by this cited source; this is not a claim of its absence.","artifacts":[{"kind":"pdf","title":"Cygan et al. · On problems as hard as CNF-SAT — proof text","url":"https://arxiv.org/pdf/1112.2275v3","version":"arXiv-1112.2275v3","assessment":"paper_proof","note":"External source text. Its mathematical claims and independent OpenMath review are assessed separately.","sha256":"292ff4c93c0834d4eb560ad0f30b6b703a972901682d5af65b65afcd4c4b0ff1"}],"published":{"value":"2014-03-27"}},"id":"pnp-seth@arXiv-1112.2275v3","source_id":"pnp-seth","title":"Cygan et al. · On problems as hard as CNF-SAT","owner":"Marek Cygan; Holger Dell; Daniel Lokshtanov; Dániel Marx; Jesper Nederlof; Yoshio Okamoto; Ramamohan Paturi; Saket Saurabh; Magnus Wahlström","url":"https://arxiv.org/pdf/1112.2275v3","subject_scope":"The precise statements and locators cited in this P versus NP research record.","revision":"arXiv-1112.2275v3","content_sha256":"292ff4c93c0834d4eb560ad0f30b6b703a972901682d5af65b65afcd4c4b0ff1","update_method":"Manual primary-source check; changes require a new source version and staff publication.","identifier_policy":"Source URL and exact theorem/section locator; no inferred identity merge.","observed_on":"2026-10-10","source_updated_on":null,"rights":"metadata-link","license":"Full-text redistribution rights not asserted","terms_url":"https://arxiv.org/pdf/1112.2275v3","attribution":"Marek Cygan; Holger Dell; Daniel Lokshtanov; Dániel Marx; Jesper Nederlof; Yoshio Okamoto; Ramamohan Paturi; Saket Saurabh; Magnus Wahlström","rights_note":"Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.","check_interval_days":30}],"entries":[{"id":"pnp-entry-seth-implies-separation:v1","source_version_id":"pnp-seth@arXiv-1112.2275v3","item_id":"seth-implies-separation","url":"https://arxiv.org/pdf/1112.2275v3","wording":"If the stated bounded-error randomized SETH holds, then P ≠ NP.","wording_kind":"paraphrase","locator":"§1 definition; Theorem 1.1(i); immediate consequence using deterministic algorithms as a subclass","supersedes":null},{"id":"pnp-entry-seth:v1","source_version_id":"pnp-seth@arXiv-1112.2275v3","item_id":"seth","url":"https://arxiv.org/pdf/1112.2275v3","wording":"For every fixed α in (0,1), there is a fixed clause width k such that k-CNF-SAT on n variables has no bounded-error randomized O(2^{αn})-time algorithm.","wording_kind":"paraphrase","locator":"§1, Previous Work, p. 1; Theorem 1.1(i)","supersedes":null}],"problems":[{"slug":"p-vs-np","title":"P versus NP","publication_version":14}],"selected_version_id":"pnp-seth@arXiv-1112.2275v3","available_versions":[{"id":"pnp-seth@arXiv-1112.2275v3","revision":"arXiv-1112.2275v3","observed_on":"2026-10-10","title":"Cygan et al. · On problems as hard as CNF-SAT","publication":"preprint","content_sha256":"292ff4c93c0834d4eb560ad0f30b6b703a972901682d5af65b65afcd4c4b0ff1","used_in_current_publications":true}],"usages":[{"id":"source-use-4df1041025a3a8890072","entry_id":"pnp-entry-seth-implies-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Established implication or scoped theorem in cited mathematics","claim":{"id":"claim-pnp-seth-implies-separation","version":2,"slug":"pnp-seth-implies-separation","title":"Randomized SETH would separate P and NP"},"fragment":"claim-pnp-seth-implies-separation","assessment":{"id":"pnp-report-seth-implies-separation:v1","entry_id":"pnp-entry-seth-implies-separation:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"Only a sufficient stronger premise; P ≠ NP gives no such exponent or randomized lower bound.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://arxiv.org/pdf/1112.2275v3","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-e348c909d86bdfcf432c","entry_id":"pnp-entry-seth-implies-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"connection","title":"The cited randomized SETH excludes even fixed-base exponential improvements for some clause width, and therefore excludes polynomial deterministic algorithms.","claim":{"id":"claim-pnp-seth-implies-separation","version":2,"slug":"pnp-seth-implies-separation","title":"Randomized SETH would separate P and NP"},"fragment":"claim-pnp-seth-implies-separation","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-e739c9e8a94d98842ed6","entry_id":"pnp-entry-seth-implies-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-0557dc6164eb4ec5b914","entry_id":"pnp-entry-seth-implies-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"Randomized SETH would separate P and NP","claim":{"id":"claim-pnp-seth-implies-separation","version":2,"slug":"pnp-seth-implies-separation","title":"Randomized SETH would separate P and NP"},"fragment":"claim-pnp-seth-implies-separation","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-c24ec8b311b136005988","entry_id":"pnp-entry-seth:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Unresolved assertion in the cited scope","claim":{"id":"claim-pnp-seth","version":2,"slug":"pnp-seth","title":"Strong Exponential Time Hypothesis — randomized version"},"fragment":"claim-pnp-seth","assessment":{"id":"pnp-report-seth:v1","entry_id":"pnp-entry-seth:v1","state":"reported_open","source_label":"Unresolved assertion in the cited scope","scope":"A fine-grained hardness premise stronger than the deterministic version; neither version follows from P ≠ NP.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://arxiv.org/pdf/1112.2275v3","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-1646f45a7dfd2986fd34","entry_id":"pnp-entry-seth:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-f589414e9c7a0332fbc7","entry_id":"pnp-entry-seth:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"Strong Exponential Time Hypothesis — randomized version","claim":{"id":"claim-pnp-seth","version":2,"slug":"pnp-seth","title":"Strong Exponential Time Hypothesis — randomized version"},"fragment":"claim-pnp-seth","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}