{"schema_version":"source-reader-v1","record":{"source_id":"pnp-rr","versions":[{"work":{"authors":["Alexander Razborov","Steven Rudich"],"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":"Razborov–Rudich · Natural proofs — proof text","url":"https://www.cs.umd.edu/~gasarch/BLOGPAPERS/natural.pdf","version":"STOC-1994-author-paper","assessment":"paper_proof","note":"External source text. Its mathematical claims and independent OpenMath review are assessed separately.","sha256":"493cd619b123213f23de32f5075f34d30c563cbd562e025c99b0207568bc1c58"}],"published":{"value":"1994"}},"id":"pnp-rr@STOC-1994-author-paper","source_id":"pnp-rr","title":"Razborov–Rudich · Natural proofs","owner":"Alexander Razborov; Steven Rudich","url":"https://www.cs.umd.edu/~gasarch/BLOGPAPERS/natural.pdf","subject_scope":"The precise statements and locators cited in this P versus NP research record.","revision":"STOC-1994-author-paper","content_sha256":"493cd619b123213f23de32f5075f34d30c563cbd562e025c99b0207568bc1c58","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://www.cs.umd.edu/~gasarch/BLOGPAPERS/natural.pdf","attribution":"Alexander Razborov; Steven Rudich","rights_note":"Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.","check_interval_days":30}],"entries":[{"id":"pnp-entry-natural-proofs:v1","source_version_id":"pnp-rr@STOC-1994-author-paper","item_id":"natural-proofs","url":"https://www.cs.umd.edu/~gasarch/BLOGPAPERS/natural.pdf","wording":"If a polynomial-size pseudorandom generator G_k: {0,1}^k → {0,1}^{2k} has hardness H(G_k) ≥ 2^{k^ε} for some fixed ε > 0 and all sufficiently large k, then no P-natural property useful against P/poly exists.","wording_kind":"paraphrase","locator":"§2.2 (natural properties), p. 7; hardness definition and Theorem 4.1, p. 15","supersedes":null}],"problems":[{"slug":"p-vs-np","title":"P versus NP","publication_version":14}],"selected_version_id":"pnp-rr@STOC-1994-author-paper","available_versions":[{"id":"pnp-rr@STOC-1994-author-paper","revision":"STOC-1994-author-paper","observed_on":"2026-10-10","title":"Razborov–Rudich · Natural proofs","publication":"published","content_sha256":"493cd619b123213f23de32f5075f34d30c563cbd562e025c99b0207568bc1c58","used_in_current_publications":true}],"usages":[{"id":"source-use-e42e3a2c73eabf3111ac","entry_id":"pnp-entry-natural-proofs: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-natural-proofs","version":2,"slug":"pnp-natural-proofs","title":"The natural-proofs barrier is conditional"},"fragment":"claim-pnp-natural-proofs","assessment":{"id":"pnp-report-natural-proofs:v1","entry_id":"pnp-entry-natural-proofs:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"A conditional barrier for this precise kind of circuit-lower-bound method; not for all mathematical proofs.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.cs.umd.edu/~gasarch/BLOGPAPERS/natural.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-6fe1082cdf3ca3a1b845","entry_id":"pnp-entry-natural-proofs:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"milestone","title":"Natural proofs connect lower bounds to pseudorandomness","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-233476f3c9128646dee9","entry_id":"pnp-entry-natural-proofs: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-87140a9f7f4ffacd014d","entry_id":"pnp-entry-natural-proofs:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"The natural-proofs barrier is conditional","claim":{"id":"claim-pnp-natural-proofs","version":2,"slug":"pnp-natural-proofs","title":"The natural-proofs barrier is conditional"},"fragment":"claim-pnp-natural-proofs","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}