{"id": "card_chain_razborov_rudich_1997", "kind": "reference", "title": "Razborov 1997 — Natural proofs", "body": "A. A. Razborov, S. Rudich (1997). Natural proofs. J. Comput. System Sci. 55 (1997) 24–35. DOI 10.1006/jcss.1997.1494. Canonical: https://doi.org/10.1006/jcss.1997.1494. Cited by its record. License as found: Elsevier open archive user license — free to read. What it gave the chain: the second barrier: natural proofs cannot, if one-way functions exist.", "source": {"label": "A. A. Razborov, S. Rudich (1997), J. Comput. System Sci. 55 (1997) 24–35", "url": "https://doi.org/10.1006/jcss.1997.1494", "domain": "computer_science", "authority_tier": "reference"}, "shelf": "codex", "box": "chain", "bands": ["chain", "record", "1997", "razborov", "computer science"], "subject": "Natural proofs", "connections": [{"to_card_id": "card_chain_baker_gill_solovay_1975", "relationship": "builds_on", "evidence": "the second barrier: natural proofs cannot, if one-way functions exist"}, {"to_card_id": "card_chain_aaronson_wigderson_2009", "relationship": "enables", "evidence": "the third barrier: algebrizing proofs cannot"}], "author": "engine", "created_at": 0.0, "updated_at": 0.0, "visibility": "public", "lifecycle_stage": "public", "volatility": "permanent", "surface": "secular", "generated": false, "call": "codex.chain", "facets": {"subject": ["1997", "computer science", "razborov", "record"]}, "presentation": {"glyph": "•", "kind_label": "chain", "by": "A. A. Razborov, S. Rudich (1997), J. Comput. System Sci. 55 (1997) 24–35", "authority": "reference", "posted": "", "standing": "", "link": {"url": "https://doi.org/10.1006/jcss.1997.1494", "host": "doi.org", "provider": "", "titled": "Razborov 1997 — Natural proofs", "waybill_line": "", "reach": "", "embed": ""}}, "neighbors": [{"id": "card_chain_baker_gill_solovay_1975", "title": "Baker 1975 — Relativizations of the P =? NP question", "relationship": "builds on", "why": "the second barrier: natural proofs cannot, if one-way functions exist", "href": "/card/card_chain_baker_gill_solovay_1975", "resolved": true}, {"id": "card_chain_aaronson_wigderson_2009", "title": "Aaronson 2009 — Algebrization: a new barrier in complexity theory", "relationship": "enables", "why": "the third barrier: algebrizing proofs cannot", "href": "/card/card_chain_aaronson_wigderson_2009", "resolved": true}], "house": {"door": "FIND", "kind": "card", "trail": "connections", "seal": "/card/card_chain_razborov_rudich_1997", "next_step": {"do": "read the source itself", "door": "FIND", "web": "/reader.html?card=card_chain_razborov_rudich_1997"}, "ends": "a verdict or a card · the trail · a seal · one next step"}}