{"schema_version":"source-reader-v1","record":{"source_id":"pnp-eth","versions":[{"work":{"authors":["Russell Impagliazzo","Ramamohan Paturi"],"kind":"research_paper","publication":"published","publication_note":"Published author exposition or original paper.","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":"Impagliazzo–Paturi · On the complexity of k-SAT — proof text","url":"https://cseweb.ucsd.edu/~paturi/myPapers/pubs/ImpagliazzoPaturi_2001_jcss.pdf","version":"JCSS-2001","assessment":"paper_proof","note":"External source text. Its mathematical claims and independent OpenMath review are assessed separately.","sha256":"1b7d20af963735666020e844f8a454fbb64893a5f3b3c488c99d1f4bdae5c11c"}],"published":{"value":"2001-03"}},"id":"pnp-eth@JCSS-2001","source_id":"pnp-eth","title":"Impagliazzo–Paturi · On the complexity of k-SAT","owner":"Russell Impagliazzo; Ramamohan Paturi","url":"https://cseweb.ucsd.edu/~paturi/myPapers/pubs/ImpagliazzoPaturi_2001_jcss.pdf","subject_scope":"The precise statements and locators cited in this P versus NP research record.","revision":"JCSS-2001","content_sha256":"1b7d20af963735666020e844f8a454fbb64893a5f3b3c488c99d1f4bdae5c11c","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://cseweb.ucsd.edu/~paturi/myPapers/pubs/ImpagliazzoPaturi_2001_jcss.pdf","attribution":"Russell Impagliazzo; Ramamohan Paturi","rights_note":"Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.","check_interval_days":30}],"entries":[{"id":"pnp-entry-eth-implies-separation:v1","source_version_id":"pnp-eth@JCSS-2001","item_id":"eth-implies-separation","url":"https://cseweb.ucsd.edu/~paturi/myPapers/pubs/ImpagliazzoPaturi_2001_jcss.pdf","wording":"If ETH holds, then P ≠ NP.","wording_kind":"paraphrase","locator":"§1–2, k-SAT exponential complexity and hypothesis","supersedes":null},{"id":"pnp-entry-eth:v1","source_version_id":"pnp-eth@JCSS-2001","item_id":"eth","url":"https://cseweb.ucsd.edu/~paturi/myPapers/pubs/ImpagliazzoPaturi_2001_jcss.pdf","wording":"3SAT cannot be decided in deterministic time 2^{o(n)} times a polynomial in the input length, where n is the number of variables.","wording_kind":"paraphrase","locator":"§1, definition of s_k and the exponential-time hypothesis","supersedes":null}],"problems":[{"slug":"p-vs-np","title":"P versus NP","publication_version":14}],"selected_version_id":"pnp-eth@JCSS-2001","available_versions":[{"id":"pnp-eth@JCSS-2001","revision":"JCSS-2001","observed_on":"2026-10-10","title":"Impagliazzo–Paturi · On the complexity of k-SAT","publication":"published","content_sha256":"1b7d20af963735666020e844f8a454fbb64893a5f3b3c488c99d1f4bdae5c11c","used_in_current_publications":true}],"usages":[{"id":"source-use-e0ace0d5b00c348c7849","entry_id":"pnp-entry-eth-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-eth-implies-separation","version":2,"slug":"pnp-eth-implies-separation","title":"ETH would separate P and NP"},"fragment":"claim-pnp-eth-implies-separation","assessment":{"id":"pnp-report-eth-implies-separation:v1","entry_id":"pnp-entry-eth-implies-separation:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"A sufficient stronger hardness hypothesis; P ≠ NP does not establish ETH.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://cseweb.ucsd.edu/~paturi/myPapers/pubs/ImpagliazzoPaturi_2001_jcss.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-f483a3b61cf7d203ee17","entry_id":"pnp-entry-eth-implies-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"connection","title":"ETH rules out even subexponential 3SAT algorithms in the stated model.","claim":{"id":"claim-pnp-eth-implies-separation","version":2,"slug":"pnp-eth-implies-separation","title":"ETH would separate P and NP"},"fragment":"claim-pnp-eth-implies-separation","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-dc713f523cf0c1ae0e7f","entry_id":"pnp-entry-eth-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-0e4e332544183968f229","entry_id":"pnp-entry-eth-implies-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"ETH would separate P and NP","claim":{"id":"claim-pnp-eth-implies-separation","version":2,"slug":"pnp-eth-implies-separation","title":"ETH would separate P and NP"},"fragment":"claim-pnp-eth-implies-separation","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-3317e667343e3116204f","entry_id":"pnp-entry-eth: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-eth","version":2,"slug":"pnp-eth","title":"Exponential Time Hypothesis"},"fragment":"claim-pnp-eth","assessment":{"id":"pnp-report-eth:v1","entry_id":"pnp-entry-eth:v1","state":"reported_open","source_label":"Unresolved assertion in the cited scope","scope":"A stronger quantitative hypothesis than P ≠ NP.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://cseweb.ucsd.edu/~paturi/myPapers/pubs/ImpagliazzoPaturi_2001_jcss.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-2b1a441f9c5082001d11","entry_id":"pnp-entry-eth: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-c5a34fef305f20d7dbeb","entry_id":"pnp-entry-eth:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"Exponential Time Hypothesis","claim":{"id":"claim-pnp-eth","version":2,"slug":"pnp-eth","title":"Exponential Time Hypothesis"},"fragment":"claim-pnp-eth","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}