{"index":{"byClaim":[["prov-fsf-v2-0-alert-threshold",["documents:frontier-safety-frameworks"]],["ts-a1-turing-c1951-context",["propositions:superintelligence"]],["ts-a1-more-1998-contests",["propositions:superintelligence"]],["ts-b2-christiano-2022-contests",["propositions:superintelligence"]],["ec-g01-davidson-2021-explosive-economic-growth-a",["propositions:economics-of-machine-intelligence"]],["ec-m01-krueger-1991-computers-wage-structure-a",["propositions:economics-of-machine-intelligence"]],["ec-m01-acemoglu-restrepo-2019-automation-and-new-tasks-b",["propositions:economics-of-machine-intelligence"]],["ec-m04-agrawal-gans-goldfarb-2018-prediction-judgment-complexity-a",["propositions:economics-of-machine-intelligence"]],["ec-m06a-acemoglu-restrepo-2016-race-between-machine-and-man-a",["propositions:economics-of-machine-intelligence"]],["ec-m06b-nilsson-1984-ai-employment-and-income-a",["propositions:economics-of-machine-intelligence"]],["ec-e01-nordhaus-2015-economic-singularity-b",["propositions:economics-of-machine-intelligence"]],["ec-e03-gans-2023-socially-minded-governance-agi-b",["propositions:economics-of-machine-intelligence"]],["cmp-rsp-v3-3-d6-discretion",["compare:frontier-safety-frameworks"]],["cmp-ms-fgf-2026-d6-competitor",["compare:frontier-safety-frameworks"]],["cmp-rsp-v2-1-d2-levels",["compare:frontier-safety-frameworks"]],["cmp-fsf-2024-d8-process",["compare:frontier-safety-frameworks"]],["cmp-faif-2026-d1-cyber",["compare:frontier-safety-frameworks"]],["cmp-meta-faf-v1-1-d6-discretion",["compare:frontier-safety-frameworks"]],["fl-link-ms-fgf-2026-eu-ai-act",["documents:frontier-safety-frameworks","guide:frontier-frameworks-and-law"]],["rd-r02-omohundro-2007-nature-self-improving",["propositions:risk-debate"]],["rd-r08-gans-2023-not-worried",["propositions:risk-debate"]],["rd-r10b-bengio-2019-instrumental-convergence-thread",["propositions:risk-debate"]]],"marks":[["davidson-2021-explosive-economic-growth",[{"collectionId":"economics-of-machine-intelligence","propositionId":"explosive-growth-from-labour-substitution","claimId":"ec-g01-davidson-2021-explosive-economic-growth-a","text":"Earliest located in tier 2 of Economics of machine intelligence for G01 Machine substitution for labour produces explosive growth"},{"collectionId":"economics-of-machine-intelligence","propositionId":"accelerating-growth-from-automated-research","claimId":"ec-g02-davidson-2021-explosive-economic-growth-a","text":"Earliest located in tier 2 of Economics of machine intelligence for G02 Automated research produces accelerating growth"},{"collectionId":"economics-of-machine-intelligence","propositionId":"unautomated-tasks-bottleneck-growth","claimId":"ec-g04-davidson-2021-explosive-economic-growth-c","text":"Earliest located tier-2 text contesting G04 Essential unautomated tasks bottleneck growth in Economics of machine intelligence"},{"collectionId":"economics-of-machine-intelligence","propositionId":"other-constraints-prevent-explosive-growth","claimId":"ec-g05-davidson-2021-explosive-economic-growth-c","text":"Earliest located tier-2 text contesting G05 Other constraints prevent explosive growth in Economics of machine intelligence"},{"collectionId":"economics-of-machine-intelligence","propositionId":"no-current-sign-of-explosive-growth","claimId":"ec-g06-davidson-2021-explosive-economic-growth-a","text":"Earliest located in tier 2 of Economics of machine intelligence for G06 Current data show no approach to explosive growth"}]],["acemoglu-restrepo-2016-race-between-machine-and-man",[{"collectionId":"economics-of-machine-intelligence","propositionId":"machines-cheaper-at-every-task","claimId":"ec-m05-acemoglu-restrepo-2016-race-between-machine-and-man-a","text":"Earliest located in tier 1 of Economics of machine intelligence for M05 Machines cheaper than labour at every task"}]],["nilsson-1984-ai-employment-and-income",[{"collectionId":"economics-of-machine-intelligence","propositionId":"automation-as-ordinary-technical-change","claimId":"ec-m01-nilsson-1984-ai-employment-and-income-c","text":"Earliest located tier-2 text contesting M01 Computers and AI as ordinary technical change in Economics of machine intelligence"},{"collectionId":"economics-of-machine-intelligence","propositionId":"machines-cheaper-at-every-task","claimId":"ec-m05-nilsson-1984-ai-employment-and-income-a","text":"Earliest located in tier 2 of Economics of machine intelligence for M05 Machines cheaper than labour at every task"}]],["nordhaus-2015-economic-singularity",[{"collectionId":"economics-of-machine-intelligence","propositionId":"unautomated-tasks-bottleneck-growth","claimId":"ec-g04-nordhaus-2015-economic-singularity-a","text":"Earliest located in tier 1 of Economics of machine intelligence for G04 Essential unautomated tasks bottleneck growth"},{"collectionId":"economics-of-machine-intelligence","propositionId":"other-constraints-prevent-explosive-growth","claimId":"ec-g05-nordhaus-2015-economic-singularity-c","text":"Earliest located tier-1 text contesting G05 Other constraints prevent explosive growth in Economics of machine intelligence"},{"collectionId":"economics-of-machine-intelligence","propositionId":"ai-existential-risk-in-economic-analysis","claimId":"ec-e03-nordhaus-2015-economic-singularity-a","text":"Earliest located in tier 1 of Economics of machine intelligence for E03 Existential risk from AI as a matter for economic analysis"},{"collectionId":"economics-of-machine-intelligence","propositionId":"economics-engagement-with-superintelligence","claimId":"ec-e05-nordhaus-2015-economic-singularity-a","text":"Earliest located in tier 1 of Economics of machine intelligence for E05 Economics’ engagement with superintelligence, AGI and the singularity"}]],["gans-2023-socially-minded-governance-agi",[{"collectionId":"economics-of-machine-intelligence","propositionId":"ai-developer-incentives-and-safety","claimId":"ec-e04-gans-2023-socially-minded-governance-agi-a","text":"Earliest located in tier 1 of Economics of machine intelligence for E04 AI developers’ incentives matter for safety"}]],["acemoglu-2024-simple-macroeconomics-of-ai",[{"collectionId":"economics-of-machine-intelligence","propositionId":"modest-near-term-ai-productivity-effect","claimId":"ec-g08-acemoglu-2024-simple-macroeconomics-of-ai-a","text":"Earliest located in tier 1 of Economics of machine intelligence for G08 AI’s near-term aggregate productivity effect is modest"},{"collectionId":"economics-of-machine-intelligence","propositionId":"ai-productivity-over-next-decade","claimId":"ec-m08-acemoglu-2024-simple-macroeconomics-of-ai-a","text":"Earliest located in tier 1 of Economics of machine intelligence for M08 AI’s productivity effect over the next decade"}]],["omohundro-2007-nature-self-improving",[{"collectionId":"risk-debate","propositionId":"instrumental-convergence","claimId":"rd-r02-omohundro-2007-nature-self-improving","text":"Earliest located in Arguments about catastrophic risk from advanced AI for R02 Instrumental convergence"}]]],"chronicle":{"years":[{"year":1863,"topics":{"ideas":5},"stated":0},{"year":1865,"topics":{"ideas":1},"stated":0},{"year":1872,"topics":{"ideas":7},"stated":0},{"year":1943,"topics":{"ideas":1},"stated":0},{"year":1947,"topics":{"ideas":2},"stated":0},{"year":1950,"topics":{"ideas":7},"stated":0},{"year":1951,"topics":{"ideas":5},"stated":0},{"year":1952,"topics":{"ideas":2},"stated":0},{"year":1955,"topics":{"ideas":31},"stated":0},{"year":1956,"topics":{"ideas":1},"stated":0},{"year":1957,"topics":{"ideas":1},"stated":0},{"year":1958,"topics":{"ideas":3},"stated":0},{"year":1959,"topics":{"ideas":6},"stated":0},{"year":1960,"topics":{"ideas":11},"stated":0},{"year":1961,"topics":{"ideas":10},"stated":0},{"year":1965,"topics":{"ideas":8},"stated":0},{"year":1966,"topics":{"ideas":20},"stated":0},{"year":1968,"topics":{"ideas":5},"stated":0},{"year":1969,"topics":{"ideas":2},"stated":0},{"year":1971,"topics":{"ideas":4},"stated":0},{"year":1972,"topics":{"ideas":1},"stated":0},{"year":1973,"topics":{"ideas":2},"stated":0},{"year":1974,"topics":{"ideas":2},"stated":0},{"year":1975,"topics":{"ideas":1},"stated":0},{"year":1976,"topics":{"ideas":1},"stated":0},{"year":1977,"topics":{"people":2,"ideas":8},"stated":0},{"year":1979,"topics":{"ideas":4},"stated":0},{"year":1980,"topics":{"ideas":2},"stated":0},{"year":1981,"topics":{"people":2},"stated":0},{"year":1982,"topics":{"ideas":4},"stated":0},{"year":1983,"topics":{"ideas":4},"stated":0},{"year":1984,"topics":{"ideas":21},"stated":0},{"year":1985,"topics":{"ideas":9},"stated":0},{"year":1986,"topics":{"ideas":18},"stated":0},{"year":1987,"topics":{"ideas":1},"stated":0},{"year":1988,"topics":{"ideas":6},"stated":0},{"year":1989,"topics":{"ideas":8},"stated":0},{"year":1990,"topics":{"ideas":5},"stated":0},{"year":1991,"topics":{"ideas":11},"stated":0},{"year":1992,"topics":{"ideas":9},"stated":0},{"year":1993,"topics":{"ideas":14,"people":3},"stated":0},{"year":1994,"topics":{"ideas":14},"stated":0},{"year":1995,"topics":{"ideas":10,"people":1},"stated":0},{"year":1996,"topics":{"ideas":71},"stated":0},{"year":1997,"topics":{"ideas":12},"stated":0},{"year":1998,"topics":{"ideas":49},"stated":0},{"year":1999,"topics":{"ideas":27,"people":1,"institutions":1},"stated":0},{"year":2000,"topics":{"ideas":62},"stated":0},{"year":2001,"topics":{"ideas":39},"stated":0},{"year":2002,"topics":{"ideas":30},"stated":0},{"year":2003,"topics":{"ideas":8},"stated":0},{"year":2004,"topics":{"ideas":12,"people":3},"stated":0},{"year":2005,"topics":{"ideas":10,"people":1},"stated":0},{"year":2006,"topics":{"ideas":26,"people":1},"stated":0},{"year":2007,"topics":{"ideas":20},"stated":0},{"year":2008,"topics":{"ideas":57,"people":3,"institutions":1},"stated":0},{"year":2009,"topics":{"ideas":10,"people":1},"stated":0},{"year":2010,"topics":{"people":3,"ideas":11,"institutions":1,"governance":4},"stated":0},{"year":2011,"topics":{"people":3,"ideas":7,"institutions":2},"stated":0},{"year":2012,"topics":{"people":4,"ideas":17,"institutions":2},"stated":0},{"year":2013,"topics":{"ideas":46,"people":4,"institutions":2,"capital":1},"stated":0},{"year":2014,"topics":{"institutions":2,"ideas":54,"people":5},"stated":0},{"year":2015,"topics":{"people":22,"ideas":122,"institutions":3,"capital":1},"stated":0},{"year":2016,"topics":{"ideas":88,"people":2},"stated":0},{"year":2017,"topics":{"people":16,"institutions":2,"ideas":128,"governance":2},"stated":0},{"year":2018,"topics":{"people":8,"ideas":158,"institutions":8,"governance":1},"stated":0},{"year":2019,"topics":{"capital":1,"compute":1,"people":10,"governance":19,"ideas":175,"institutions":4},"stated":0},{"year":2020,"topics":{"people":6,"ideas":98,"institutions":1,"governance":2},"stated":0},{"year":2021,"topics":{"people":27,"ideas":177,"compute":1,"institutions":23,"governance":4,"capital":6},"stated":0},{"year":2022,"topics":{"people":15,"ideas":217,"institutions":6,"governance":3,"compute":2,"capital":1},"stated":0},{"year":2023,"topics":{"capital":5,"compute":7,"institutions":23,"people":51,"governance":179,"ideas":389},"stated":0},{"year":2024,"topics":{"capital":12,"compute":19,"governance":282,"people":80,"ideas":178,"institutions":28},"stated":1},{"year":2025,"topics":{"governance":547,"compute":69,"capital":34,"people":90,"institutions":18,"ideas":178},"stated":7},{"year":2026,"topics":{"governance":442,"capital":8,"compute":32,"institutions":21,"ideas":91,"people":107},"stated":19},{"year":2027,"topics":{},"stated":9},{"year":2028,"topics":{},"stated":6},{"year":2029,"topics":{},"stated":3},{"year":2030,"topics":{},"stated":3},{"year":2032,"topics":{},"stated":2},{"year":2035,"topics":{},"stated":2},{"year":2039,"topics":{},"stated":1},{"year":2042,"topics":{},"stated":1},{"year":2050,"topics":{},"stated":1}],"scheduled":[],"statedBy":[]},"collections":[{"target":{"kind":"propositions","id":"superintelligence"},"title":"Propositions about superintelligence, 1863–2022","claimIds":["ts-a1-turing-c1951-context","ts-a1-more-1998-contests","ts-b2-christiano-2022-contests"],"records":[]},{"target":{"kind":"propositions","id":"risk-debate"},"title":"Arguments about catastrophic risk from advanced AI","claimIds":["rd-r02-omohundro-2007-nature-self-improving","rd-r08-gans-2023-not-worried","rd-r10b-bengio-2019-instrumental-convergence-thread"],"records":[]},{"target":{"kind":"propositions","id":"yudkowsky-arguments"},"title":"Eliezer Yudkowsky’s arguments on common claims about AI, 1996–2026","claimIds":[],"records":[]},{"target":{"kind":"propositions","id":"economics-of-machine-intelligence"},"title":"Economics of machine intelligence","claimIds":["ec-g01-davidson-2021-explosive-economic-growth-a","ec-m01-krueger-1991-computers-wage-structure-a","ec-m01-acemoglu-restrepo-2019-automation-and-new-tasks-b","ec-m04-agrawal-gans-goldfarb-2018-prediction-judgment-complexity-a","ec-m06a-acemoglu-restrepo-2016-race-between-machine-and-man-a","ec-m06b-nilsson-1984-ai-employment-and-income-a","ec-e01-nordhaus-2015-economic-singularity-b","ec-e03-gans-2023-socially-minded-governance-agi-b"],"records":[]},{"target":{"kind":"propositions","id":"orbital-compute-arguments"},"title":"Arguments about compute in orbit","claimIds":[],"records":[]},{"target":{"kind":"propositions","id":"ai-bio-arguments"},"title":"Arguments about AI and biological risk","claimIds":[],"records":[]},{"target":{"kind":"propositions","id":"ai-in-science"},"title":"AI in science","claimIds":[],"records":[]},{"target":{"kind":"documents"},"title":"Frontier safety frameworks","claimIds":["prov-fsf-v2-0-alert-threshold","fl-link-ms-fgf-2026-eu-ai-act"]},{"target":{"kind":"compare","id":"frontier-safety-frameworks"},"title":"Compare frameworks","claimIds":["cmp-rsp-v3-3-d6-discretion","cmp-ms-fgf-2026-d6-competitor","cmp-rsp-v2-1-d2-levels","cmp-fsf-2024-d8-process","cmp-faif-2026-d1-cyber","cmp-meta-faf-v1-1-d6-discretion"]},{"target":{"kind":"control","id":"openai"},"title":"OpenAI’s control structure, 2015–2026","claimIds":[]},{"target":{"kind":"control","id":"anthropic"},"title":"Anthropic’s control structure, 2021–2026","claimIds":[]},{"target":{"kind":"commitments"},"title":"External commitments and obligations","claimIds":[]},{"target":{"kind":"question","id":"frameworks-to-obligations"},"title":"Frameworks, commitments and legal obligations, 2023–2026","claimIds":[]},{"target":{"kind":"reading"},"title":"Founding and early leadership","claimIds":[]}]},"entities":[{"id":"openai","name":"OpenAI","type":"organisation"},{"id":"xai","name":"xAI","type":"organisation"},{"id":"nvidia","name":"NVIDIA","type":"organisation"},{"id":"eliezer-yudkowsky","name":"Eliezer Yudkowsky","type":"person"},{"id":"rsp-2023","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v1.0","publisherId":"anthropic","publishedAt":"2023-09-19","effectiveAt":"2023-09-19","dateNote":"Initial public policy dated September 19, 2023; original entity and publication claim retained."}},{"id":"fsf-2024","type":"document","documentVersion":{"family":"deepmind-fsf","label":"v1.0","publisherId":"google-deepmind","publishedAt":"2024-05-17","dateNote":"The sourced publication date does not establish an implementation or effective date."},"name":"Frontier Safety Framework (2024)"},{"id":"intelligence-explosion","name":"Intelligence explosion","type":"concept","proposition":{"code":"A1","criterion":"A machine (or machine-augmented) intelligence, once capable enough, increases intelligence further through its own design or research capacity, giving a runaway or rapidly compounding rise.","terms":["intelligence explosion"]}},{"id":"rsp-v2-0","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v2.0","publisherId":"anthropic","effectiveAt":"2024-10-15","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"rsp-v2-1","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v2.1","publisherId":"anthropic","effectiveAt":"2025-03-31","dateNote":"The stated effective date is retained; a separate publication day is not inferred."},"name":"Anthropic Responsible Scaling Policy — v2.1"},{"id":"rsp-v2-2","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v2.2","publisherId":"anthropic","effectiveAt":"2025-05-14","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"rsp-v3-0","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v3.0","publisherId":"anthropic","publishedAt":"2026-02-24","effectiveAt":"2026-02-24","dateNote":"The cover effective date and release announcement publication date both identify February 24, 2026."}},{"id":"rsp-v3-1","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v3.1","publisherId":"anthropic","effectiveAt":"2026-04-02","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"rsp-v3-2","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v3.2","publisherId":"anthropic","effectiveAt":"2026-04-29","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"rsp-v3-3","name":"Anthropic Responsible Scaling Policy — v3.3","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v3.3","publisherId":"anthropic","effectiveAt":"2026-05-26","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"rsp-v3-4","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v3.4","publisherId":"anthropic","effectiveAt":"2026-07-08","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"fsf-v2-0","name":"Google DeepMind Frontier Safety Framework — v2.0","type":"document","documentVersion":{"family":"deepmind-fsf","label":"v2.0","publisherId":"google-deepmind","publishedAt":"2025-02-04","dateNote":"The sourced publication date does not establish an implementation or effective date."}},{"id":"fsf-v3-0","type":"document","documentVersion":{"family":"deepmind-fsf","label":"v3.0","publisherId":"google-deepmind","publishedAt":"2025-09-22","dateNote":"The sourced publication date does not establish an implementation or effective date."}},{"id":"fsf-v3-1","type":"document","documentVersion":{"family":"deepmind-fsf","label":"v3.1","publisherId":"google-deepmind","publishedAt":"2026-04-17","dateNote":"The sourced publication date does not establish an implementation or effective date."}},{"id":"faif-2025","type":"document","documentVersion":{"family":"xai-faif","label":"December 2025 edition","publisherId":"xai","revisedAt":"2025-12-30","dateNote":"The printed update date is retained; it is not silently treated as publication. The URL filename says December 31; the visible document says last updated December 30."}},{"id":"faif-2026","name":"xAI Frontier Artificial Intelligence Framework — June 2026 edition","type":"document","documentVersion":{"family":"xai-faif","label":"June 2026 edition","publisherId":"xai","effectiveAt":"2026-06-30","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"stargate-abilene","name":"Stargate I, Abilene","type":"infrastructure"},{"id":"greg-brockman","name":"Greg Brockman","type":"person"},{"id":"alphafold-paper","name":"Highly accurate protein structure prediction with AlphaFold (2021)","type":"document"},{"id":"mark-zuckerberg","name":"Mark Zuckerberg","type":"person"},{"id":"meta-open-strategy-2024","name":"Open Source AI Is the Path Forward (2024)","type":"document"},{"id":"qwen-report","name":"Qwen Technical Report","type":"document"},{"id":"meta-faf-v1-1","name":"Meta Frontier AI Framework — Version 1.1","type":"document","documentVersion":{"family":"meta-frontier-ai","label":"v1.1","publisherId":"meta","publishedAt":"2025-02-03","dateNote":"Publication date from Meta’s dated announcement of February 3, 2025; Meta’s v2 change log also dates the initial version February 3, 2025. The earliest archive capture of the file is 2025-02-13; a revised expression under the same label followed by 2025-03-28."}},{"id":"meta-aasf-v2-0","type":"document","documentVersion":{"family":"meta-frontier-ai","label":"v2.0","publisherId":"meta","publishedAt":"2026-04-08","dateNote":"Publication date from Meta’s dated announcement of April 8, 2026; the framework’s own change log dates the version April 7, 2026."}},{"id":"ms-fgf-2025","type":"document","documentVersion":{"family":"microsoft-frontier-governance","label":"Feb 2025 (Version 1)","publisherId":"microsoft","publishedAt":"2025-02","dateNote":"Page footers read “Version 1 (February 2025)” and the change log dates the first version 8 February 2025. No separate dated announcement was located; the earliest archive capture is 2025-02-26, so publication is dated only to the month."}},{"id":"ms-fgf-2026","name":"Microsoft Frontier Governance Framework — February 2026","type":"document","documentVersion":{"family":"microsoft-frontier-governance","label":"Feb 2026","publisherId":"microsoft","revisedAt":"2026-02","dateNote":"The edition’s footers and change log date it February 2026. A publication date is not established: the file was last modified 2026-03-24 and first captured 2026-04-24."}},{"id":"turing-c1951-heretical-theory","name":"Intelligent Machinery, a Heretical Theory","type":"document"},{"id":"extropians-1997-09-24-yudkowsky","name":"Singularity: Generation gap","type":"document"},{"id":"more-1998-singularity-meets-economy","name":"Singularity Meets Economy (Comments on Vinge’s Singularity)","type":"document"},{"id":"christiano-2022-where-i-agree-and-disagree","name":"Where I agree and disagree with Eliezer","type":"document"},{"id":"strategic-concealment","name":"Strategic concealment","type":"concept","proposition":{"code":"B2","criterion":"A system deliberately hides its capabilities, intentions or activities, or manipulates people while appearing benign, for its own strategic reasons.","terms":[]}},{"id":"lw-2023-gpts-are-predictors-not-imitators","name":"GPTs are Predictors, not Imitators","type":"document"},{"id":"eu-ai-act-2024","name":"Regulation (EU) 2024/1689 (Artificial Intelligence Act), as published in the Official Journal","type":"document","documentVersion":{"family":"eu-ai-act","label":"As published in the Official Journal (12 July 2024)","publisherId":"european-parliament-and-council","publishedAt":"2024-07-12","dateNote":"The Official Journal header gives 12.7.2024 and the act is dated 13 June 2024 (signature). Article 113 sets separate dates of entry into force and application by chapter; no single effective date is recorded for the edition. Regulation (EU) 2026/1744 of 8 July 2026 later amended it; the consolidated text was not inspected."}},{"id":"explosive-growth-from-labour-substitution","name":"Machine substitution for labour produces explosive growth","type":"concept","proposition":{"code":"G01","criterion":"The text states that if machines (AI systems or emulated minds) can substitute for human labour across all or nearly all tasks, so that labour can be produced like capital, the growth rate of output rises far above historical rates (by roughly an order of magnitude or more) or keeps rising. The conditions under which the text derives this are part of the record.","terms":[]}},{"id":"automation-as-ordinary-technical-change","name":"Computers and AI as ordinary technical change","type":"concept","proposition":{"code":"M01","criterion":"A tier-1 text dated before 2015 that discusses computers, automation or AI and analyses them with the tools used for technical change in general (factor-augmenting or skill-biased change, capital deepening), with no separate category for machine cognition.","terms":[]}},{"id":"ai-as-cheaper-prediction","name":"AI as cheaper prediction","type":"concept","proposition":{"code":"M04","criterion":"A text that defines or treats AI's economic function as prediction and draws consequences from a fall in its cost (for example for the value of complements such as judgement or data).","terms":[]}},{"id":"automation-lowers-labour-income","name":"Automation lowers the labour share, wages or employment","type":"concept","proposition":{"code":"M06a","criterion":"A text that states or models that AI or automation lowers the labour share, wages or employment for some or all workers.","terms":[]}},{"id":"compensating-policy-for-ai","name":"Compensating policy for AI’s distributional effects","type":"concept","proposition":{"code":"M06b","criterion":"A text that argues for redistribution, taxation or another compensating policy in response to distributional effects of AI or automation.","terms":[]}},{"id":"hanson-2000-long-term-growth-exponential-modes","name":"Long-Term Growth As A Sequence of Exponential Modes","type":"document"},{"id":"nordhaus-2015-economic-singularity","name":"Are We Approaching an Economic Singularity? Information Technology and the Future of Economic Growth","type":"document"},{"id":"davidson-2021-explosive-economic-growth","name":"Could Advanced AI Drive Explosive Economic Growth?","type":"document"},{"id":"acemoglu-2024-simple-macroeconomics-of-ai","name":"The Simple Macroeconomics of AI","type":"document"},{"id":"krueger-1991-computers-wage-structure","name":"How Computers Have Changed the Wage Structure: Evidence from Microdata, 1984-89","type":"document"},{"id":"acemoglu-restrepo-2016-race-between-machine-and-man","name":"The Race Between Machine and Man: Implications of Technology for Growth, Factor Shares and Employment","type":"document"},{"id":"agrawal-gans-goldfarb-2018-prediction-judgment-complexity","name":"Prediction, Judgment and Complexity: A Theory of Decision Making and Artificial Intelligence","type":"document"},{"id":"acemoglu-restrepo-2019-automation-and-new-tasks","name":"Automation and New Tasks: How Technology Displaces and Reinstates Labor","type":"document"},{"id":"nilsson-1984-ai-employment-and-income","name":"Artificial Intelligence, Employment, and Income","type":"document"},{"id":"ai-improving-ai-accelerates-capability","name":"Machine intelligence improving itself accelerates its capability growth","type":"concept","proposition":{"code":"E01","criterion":"A text that states or models AI systems improving AI (their own capabilities, their successors' design, or AI research itself) so that capability growth accelerates. Accelerating output growth from automated idea production without AI improving AI is G02 and only bears on E01.","terms":[]}},{"id":"ai-existential-risk-in-economic-analysis","name":"Existential risk from AI as a matter for economic analysis","type":"concept","proposition":{"code":"E03","criterion":"A text that treats existential or catastrophic risk from AI (extinction, loss of control, misaligned goals) as a quantity or consideration in economic analysis, welfare trade-offs or policy.","terms":[]}},{"id":"gans-2023-socially-minded-governance-agi","name":"Can Socially-Minded Governance Control the AGI Beast?","type":"document"},{"id":"ai21-labs","name":"AI21 Labs","type":"organisation"},{"id":"amnon-shashua","name":"Amnon Shashua","type":"person"},{"id":"kyle-kosic","name":"Kyle Kosic","type":"person"},{"id":"oriol-vinyals","name":"Oriol Vinyals","type":"person"},{"id":"stepfun","name":"StepFun / 阶跃星辰","type":"organisation"},{"id":"robin-hanson","name":"Robin Hanson","type":"person"},{"id":"john-mccarthy","name":"John McCarthy","type":"person"},{"id":"ernie-3-titan-report","name":"ERNIE 3.0 Titan: Exploring Larger-scale Knowledge Enhanced Pre-training for Language Understanding and Generation","type":"document"},{"id":"aib-doc-casp14-assessment-2021","name":"Critical Assessment of Methods of Protein Structure Prediction (CASP) – Round XIV","type":"document"},{"id":"aib-pushmeet-kohli","name":"Pushmeet Kohli","type":"person"},{"id":"kp-language-models-few-shot-learners-2020","name":"Language Models are Few-Shot Learners","type":"document"},{"id":"kp-improving-language-understanding-by-generative-2018","name":"Improving Language Understanding by Generative Pre-Training","type":"document"},{"id":"kp-neural-machine-translation-rare-words-2015","name":"Neural Machine Translation of Rare Words with Subword Units","type":"document"},{"id":"kp-palm-scaling-language-modeling-pathways-2022","name":"PaLM: Scaling Language Modeling with Pathways","type":"document"},{"id":"kp-distilling-knowledge-neural-network-2015","name":"Distilling the Knowledge in a Neural Network","type":"document"},{"id":"jacob-devlin","name":"Jacob Devlin","type":"person"},{"id":"th-mccarthy-review-question-of-ai","name":"Review of The Question of Artificial Intelligence (Brian Bloomfield, ed., Croom Helm)","type":"document"},{"id":"th-rosenblatt-1958","name":"The Perceptron: A Probabilistic Model for Information Storage and Organization in the Brain","type":"document"},{"id":"th-sandewall-1969-heuristic-search","name":"Concepts and Methods for Heuristic Search","type":"document"},{"id":"th-brants-2007","name":"Large Language Models in Machine Translation","type":"document"},{"id":"th-fam-connectionism","name":"Connectionism and neural networks","type":"concept"},{"id":"th-fam-search-planning","name":"Search and planning","type":"concept"},{"id":"th-term-large-language-model","name":"'large language model'","type":"concept"},{"id":"step-5-preview-announcement","name":"阶跃发布旗舰模型 Step 5 Preview (StepFun newsroom post, 20 September 2026)","type":"document"},{"id":"bengio-2019-instrumental-convergence-thread","name":"Yoshua Bengio's comments in the Facebook thread on instrumental convergence (2019)","type":"document"},{"id":"control-by-design","name":"Advanced AI can be kept under control by design","type":"concept","proposition":{"code":"R10b","criterion":"People can build advanced AI systems with objectives, safeguards or oversight that keep them under human control, so that loss of control is avoidable in ordinary engineering practice.","terms":[]}},{"id":"gans-2023-not-worried","name":"Why I am not worried about superintelligent machines killing us all","type":"document"},{"id":"instrumental-convergence","name":"Instrumental convergence","type":"concept","proposition":{"code":"R02","criterion":"Agents with a wide range of final goals would tend to pursue the same intermediate goals, such as self-preservation, keeping their goals unchanged, acquiring resources or power, or improving themselves, because these serve almost any final goal.","terms":["instrumental convergence","convergent instrumental","basic AI drives","power-seeking"]}},{"id":"loss-of-control-route","name":"Existential risk from misalignment or loss of control","type":"concept","proposition":{"code":"R08","criterion":"Advanced AI systems pursuing goals at odds with human interests could escape human control and cause human extinction or permanent human disempowerment, without any person intending that outcome.","terms":["loss of control","rogue AI","misaligned AI","disempowerment"]}},{"id":"omohundro-2007-nature-self-improving","name":"The Nature of Self-Improving Artificial Intelligence","type":"document"}],"claims":[{"id":"abilene-nvidia-gb200-2025","subject":"stargate-abilene","predicate":"uses_hardware_from","object":{"kind":"entity","entityId":"nvidia"},"topic":"compute","statement":"OpenAI reported Oracle began delivering NVIDIA GB200 racks to Stargate I in June 2025.","time":{"kind":"snapshot","date":"2025-07-22","note":"State reported at this date; no exact start, completion date or current continuity inferred."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Delivery report, not a rack count, direct NVIDIA purchase or ownership claim; use of the supplier relation is scoped to equipment arriving at the asset.","evidenceIds":["evidence-abilene-nvidia-gb200-2025"],"attributes":{"transactionType":"hardware_deployment","relationshipContext":"external","period":"Deliveries began June 2025; snapshot reported July 22","transactionStage":"delivered"}},{"id":"xm-zuckerberg-strategy","subject":"mark-zuckerberg","predicate":"authored","object":{"kind":"entity","entityId":"meta-open-strategy-2024"},"topic":"ideas","statement":"Mark Zuckerberg authored Meta’s July 2024 open-AI strategy essay.","time":{"kind":"event","date":"2024-07-23","basis":"publication","note":"Date of this source expression; not an invention or implementation date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Authorship attribution, not endorsement of its policy or technical conclusions.","evidenceIds":["evidence-xm-zuckerberg-strategy"]},{"id":"prov-fsf-v2-0-alert-threshold","subject":"fsf-v2-0","predicate":"states_provision","object":{"kind":"literal","value":"Early warning evaluations with an alert threshold"},"topic":"governance","statement":"FSF v2.0 states that Google DeepMind will define a set of “early warning evaluations” with a specific “alert threshold” that flags when a CCL may be reached before the evaluations are run again.","time":{"kind":"event","date":"2025-02-04","basis":"publication","note":"Provision as stated in this edition, dated by the edition’s publication date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"What the edition states, quoted from the cited expression. It is not evidence of implementation, compliance or effectiveness.","evidenceIds":["evidence-prov-fsf-v2-0-alert-threshold"],"attributes":{"provision":{"kind":"threshold","key":"fsf-alert-threshold"}}},{"id":"ts-a1-turing-c1951-context","subject":"turing-c1951-heretical-theory","predicate":"bears_on_proposition","object":{"kind":"entity","entityId":"intelligence-explosion"},"topic":"ideas","statement":"Turing’s talk of about 1951 expects machines to outstrip human powers soon after machine thinking starts, and to converse with each other to sharpen their wits.","time":{"kind":"event","date":"1951","note":"Approximate year in the King’s College catalogue (c. 1951); no exact lecture day or contemporary printing is established."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Superiority and mutual sharpening, not an intelligence explosion through machine design.","evidenceIds":["evidence-ts-a1-turing-c1951-context"],"attributes":{"thought":{"roles":["context"],"register":"nonfiction","missing":"Machines sharpen their wits by conversing with each other; no design or research feedback is stated."}}},{"id":"ts-a1-more-1998-contests","subject":"more-1998-singularity-meets-economy","predicate":"contests_proposition","object":{"kind":"entity","entityId":"intelligence-explosion"},"topic":"ideas","statement":"Max More’s comment says that Vinge, like Good, expects an immediate intelligence explosion leading to a total transformation of the world, doubts both assumptions, and finds a move straight from human-level AI to drastically superintelligent thinkers doubtful. Recorded as contesting the proposition “Intelligence explosion”.","time":{"kind":"event","date":"1998","basis":"publication","note":"Comments collected in 1998; a message of 1998-09-07 quotes another paragraph of More’s comment."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"More accepts that human-level AI will come. The wording is attested only from 2000. Yudkowsky’s message of 1998-09-07 credits a challenge by More with prompting Coding a Transhuman AI.","evidenceIds":["evidence-ts-a1-more-1998-contests"],"attributes":{"thought":{"roles":["contesting"],"register":"nonfiction","qualifier":"Doubts an immediate explosion and a total transformation.","attested":{"date":"2000-08-17","note":"The quoted wording is attested by the earliest capture of the page, of 2000-08-17."},"engagement":{"kind":"engages-premise","rationale":"Gives reasons against the premise that human-level AI leads immediately to drastically superhuman intelligence: fast minds still need experiments and cooperation, and human-level cognitive scientists have not raised their own intelligence."}}}},{"id":"ts-b2-christiano-2022-contests","subject":"christiano-2022-where-i-agree-and-disagree","predicate":"contests_proposition","object":{"kind":"entity","entityId":"strategic-concealment"},"topic":"ideas","statement":"Christiano’s post disputes the picture of AI systems hiding their capabilities while lying in wait, arguing that SGD will aggressively select against systems that do not do impressive-looking things, so less impressive precursors should appear first. Recorded as contesting the proposition “Strategic concealment”.","time":{"kind":"event","date":"2022-06-19","basis":"publication","note":"Posting time 2022-06-19T19:15:55Z; the quotes also match a capture of the posting day."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"A conditional disagreement; it does not deny that concealment is possible or promise safety from good observed behaviour.","evidenceIds":["evidence-ts-b2-christiano-2022-contests"],"attributes":{"thought":{"roles":["contesting"],"register":"nonfiction","qualifier":"Disputes concealed capability combined with a sudden leap, not the possibility of concealment.","engagement":{"kind":"engages-premise","rationale":"Gives a reason against the premise that AI systems would conceal their capabilities: training for impressive-looking results aggressively selects against systems that do not show them, so less impressive precursors would appear first."}}}},{"id":"ec-g01-davidson-2021-explosive-economic-growth-a","subject":"davidson-2021-explosive-economic-growth","predicate":"articulates_proposition","object":{"kind":"entity","entityId":"explosive-growth-from-labour-substitution"},"topic":"ideas","statement":"Davidson, “Could Advanced AI Drive Explosive Economic Growth?” (2021-06-25) articulates G01. In a toy scenario in which AI robots substitute perfectly for all human labour, labour can be accumulated by investing in robots, and the report concludes that growth models then make super-exponential growth the default expectation.","time":{"kind":"event","date":"2021-06-25","basis":"publication","note":"Page: \"Published June 25, 2021\"."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Added on 2026-10-25 after the same-family and cross-family re-checks of the economics admission (maintainer decision of 2026-10-25). A model scenario: the report calls it an \"(extreme!) fiction\" and uses it to show the mechanism, not as a forecast; Davidson's overall conclusion is probabilistic. The same report's argument from automated research is recorded under G02. The passage rests on the cross-family check of 2026-10-25, which read it in the 2021-07-02 capture; in the correction pass the publisher refused requests (HTTP 403) and web.archive.org refused connections.","evidenceIds":["evidence-ec-g01-davidson-a"],"attributes":{"thought":{"roles":["earliest-located-tier-2"],"register":"nonfiction","qualifier":"A model scenario under stated conditions, not the author’s own claim.","attested":{"date":"2021-07-02","note":"Earliest retrieved capture."},"tier":{"value":2,"basis":"Tier 2 (unchanged). Research report by an author with no economics appointment, degree, address or affiliation shown in or near the text and no established record as an economist; the report says it is written to be accessible to non-economists. Under the 2026-10-11 rule the venue does not decide; the author does."},"conditions":"A toy scenario in which AI robots can perfectly substitute for all human labour, so that labour can be accumulated through investment in robots."}}},{"id":"ec-m01-krueger-1991-computers-wage-structure-a","subject":"krueger-1991-computers-wage-structure","predicate":"articulates_proposition","object":{"kind":"entity","entityId":"automation-as-ordinary-technical-change"},"topic":"ideas","statement":"Krueger, “How Computers Have Changed the Wage Structure: Evidence from Microdata, 1984-89” (1991-10) articulates M01. The conclusion places the computer premium inside the skill-biased technological change explanation of 1980s wage-structure changes, against the competing trade explanation.","time":{"kind":"event","date":"1991-10","basis":"publication","note":"Cover \"October 1991\"; text dated \"August 1991\" inside. Journal version: QJE 108(1), 1993 (Crossref census), not retrieved. Checked in a current copy; an archive capture was not available, so earlier bytes are not authenticated."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"NBER Working Paper 3858 (October 1991); OCR text layer of the NBER scan has errors, passages chosen from clean stretches. Text-level: the computer is analysed as an instance of technological change in general (the introduction names skill-biased technological change as the hypothesis tested).","evidenceIds":["evidence-ec-m01-13"],"attributes":{"thought":{"roles":["articulation"],"register":"nonfiction","tier":{"value":1,"basis":"NBER working paper (core venue); Krueger an economist."}}}},{"id":"ec-m01-acemoglu-restrepo-2019-automation-and-new-tasks-b","subject":"acemoglu-restrepo-2019-automation-and-new-tasks","predicate":"bears_on_proposition","object":{"kind":"entity","entityId":"automation-as-ordinary-technical-change"},"topic":"ideas","statement":"Acemoglu and Restrepo, “Automation and New Tasks: How Technology Displaces and Reinstates Labor” (2019-03) bears on M01. The authors contrast their task framework with the canonical factor-augmenting production function, which they say lacks descriptive realism.","time":{"kind":"event","date":"2019-03","basis":"publication","note":"Cover \"March 2019\". Journal version: JEP 33(2), 2019, pp. 3–30 (abstract page jep2019-ar). Checked in a current copy; an archive capture was not available, so earlier bytes are not authenticated."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The passage characterises a view the authors reject. A 2019 characterisation of the canonical approach; the sentence continues across the page break (pdf p. 7) saying this form imposes that all technological change is factor-augmenting. Formula as rendered in the cached text layer.","evidenceIds":["evidence-ec-m01-22"],"attributes":{"thought":{"roles":["context"],"register":"relay","missing":"A later text describing the canonical approach; not itself a pre-2015 text.","tier":{"value":1,"basis":"NBER working paper (core venue)."}}}},{"id":"ec-m04-agrawal-gans-goldfarb-2018-prediction-judgment-complexity-a","subject":"agrawal-gans-goldfarb-2018-prediction-judgment-complexity","predicate":"articulates_proposition","object":{"kind":"entity","entityId":"ai-as-cheaper-prediction"},"topic":"ideas","statement":"Agrawal, Gans, Goldfarb, “Prediction, Judgment and Complexity: A Theory of Decision Making and Artificial Intelligence” (2018-01) articulates M04. Treats AI as prediction technology and models how better prediction changes the value of judgment, the process of determining payoffs. Makes the fall in the cost of prediction the premise of the analysis. Draws the consequence of better prediction for a complement, human judgment.","time":{"kind":"event","date":"2018-01","basis":"publication","note":"Cover \"January 2018\". Chapter in the NBER volume (2019). Checked in a current copy; an archive capture was not available, so earlier bytes are not authenticated."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"(First passage) NBER Working Paper 24243, January 2018. (Second passage) NBER Working Paper 24243, January 2018. (Third passage) NBER Working Paper 24243, January 2018. Model result. It held M04’s tier-1 earliest-located role until 2026-10-25, when the same authors’ Harvard Business Review essay of November 2016 was added.","evidenceIds":["evidence-ec-m04-02","evidence-ec-m04-03","evidence-ec-m04-04"],"attributes":{"thought":{"roles":["articulation"],"register":"nonfiction","tier":{"value":1,"basis":"NBER working paper (core venue)."},"conditions":"(M04-03) Stated as an assumption of the model. (M04-04) Single-agent decision model with a risky and a safe action; holds while judgment is not too difficult; in complex environments results depend on whether prediction enables automated decision-making."}}},{"id":"ec-m06a-acemoglu-restrepo-2016-race-between-machine-and-man-a","subject":"acemoglu-restrepo-2016-race-between-machine-and-man","predicate":"articulates_proposition","object":{"kind":"entity","entityId":"automation-lowers-labour-income"},"topic":"ideas","statement":"Acemoglu and Restrepo, “The Race Between Machine and Man: Implications of Technology for Growth, Factor Shares and Employment” (2016-05) articulates M06a. Model result that automation lowers employment and the labour share and may lower wages.","time":{"kind":"event","date":"2016-05","basis":"publication","note":"Cover \"May 2016, Revised June 2017\". Journal version: AER 108(6), 2018, pp. 1488–1542 (abstract page aer2018-ar). Checked in a current copy; an archive capture was not available, so earlier bytes are not authenticated."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"NBER Working Paper 22252, May 2016, revised June 2017; quoted wording attested from the June 2017 revision, not necessarily the May 2016 original. Published in revised form as AER 2018. Model comparative static, not an empirical estimate.","evidenceIds":["evidence-ec-m06a-10"],"attributes":{"thought":{"roles":["articulation"],"register":"nonfiction","attested":{"date":"2017-06","note":"Revision date on the cover of the retrieved PDF; the May 2016 wording was not retrieved."},"tier":{"value":1,"basis":"NBER working paper (core venue)."},"conditions":"Static model, fixed capital, exogenous technology; new tasks have the opposite effects; in the dynamic model the labour share still falls with automation while long-run real wages rise."}}},{"id":"ec-m06b-nilsson-1984-ai-employment-and-income-a","subject":"nilsson-1984-ai-employment-and-income","predicate":"articulates_proposition","object":{"kind":"entity","entityId":"compensating-policy-for-ai"},"topic":"ideas","statement":"Nilsson, “Artificial Intelligence, Employment, and Income” (1984) articulates M06b. Rejecting 'Luddite' obstruction and make-work jobs, Nilsson favours decoupling income from work, reviewing transfer payments, Kelso and Adler's broadened capital ownership and Albus's National Mutual Fund.","time":{"kind":"event","date":"1984","basis":"publication","note":"Journal page: \"Vol. 5 No. 2: Summer 1984\". An AI venue, outside economics. Checked in a current copy; an archive capture was not available, so earlier bytes are not authenticated."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"AI Magazine 5(2), Summer 1984; author is an AI researcher (SRI), not an economist, and the venue is not an economics journal. OCR text layer; quoted passages verified against it. Nilsson declines to argue for or against transfer payments specifically; the proposals reviewed are other authors'.","evidenceIds":["evidence-ec-m06b-07"],"attributes":{"thought":{"roles":["articulation"],"register":"nonfiction","tier":{"value":2,"basis":"Non-economist author (an AI scientist at SRI) in an AI venue."}}}},{"id":"ec-e01-nordhaus-2015-economic-singularity-b","subject":"nordhaus-2015-economic-singularity","predicate":"bears_on_proposition","object":{"kind":"entity","entityId":"ai-improving-ai-accelerates-capability"},"topic":"ideas","statement":"Nordhaus, “Are We Approaching an Economic Singularity? Information Technology and the Future of Economic Growth” (2015-09) bears on E01. Nordhaus summarises his tests: five of seven are negative, and the two positive ones put the Singularity 100 years or more away.","time":{"kind":"event","date":"2015-09","basis":"publication","note":"Cover \"September 2015\". Checked in a current copy; an archive capture was not available, so earlier bytes are not authenticated."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Nordhaus's own empirical result. It tests a growth Singularity (20% annual growth), not AI improving AI; it is a conditional extrapolation. The ellipsis removes \"Using simple extrapolation for the two positive tests\"; five of Nordhaus's seven tests are negative, and \"100 years or more\" is a conditional extrapolation, not a forecast.","evidenceIds":["evidence-ec-e01-15"],"attributes":{"thought":{"roles":["context"],"register":"nonfiction","missing":"A growth-singularity test (growth above 20% a year), not AI improving AI (scope boundary).","tier":{"value":1,"basis":"NBER working paper (core venue); Nordhaus an economist."},"conditions":"Simple extrapolation of the two positive tests."}}},{"id":"ec-e03-gans-2023-socially-minded-governance-agi-b","subject":"gans-2023-socially-minded-governance-agi","predicate":"bears_on_proposition","object":{"kind":"entity","entityId":"ai-existential-risk-in-economic-analysis"},"topic":"ideas","statement":"Gans, “Can Socially-Minded Governance Control the AGI Beast?” (2023-11) bears on E03. Refers to the 'potential existential risks' that motivated OpenAI's funders; the model then assumes the risks are real.","time":{"kind":"event","date":"2023-11","basis":"publication","note":"Cover \"November 2023\". Checked in a current copy; an archive capture was not available, so earlier bytes are not authenticated."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"NBER w31924, November 2023. Gans cites his own 2018 paper (Gans 2018, NBER Working Paper 24352; not a source record) as questioning salience. Corrected 2026-10-15: the earlier qualification called the model's harm a positive externality and said the 2018 paper was not retrieved.","evidenceIds":["evidence-ec-e03-14"],"attributes":{"thought":{"roles":["context"],"register":"nonfiction","missing":"A literature and motivation statement, not a substantive economic treatment of the risk; the model treats harm from dangerous users as an expected negative externality (E > 0), not as extinction or loss of control.","tier":{"value":1,"basis":"NBER working paper (core venue); Gans is an economist."}}}},{"id":"lg-mx-kosic-xai-team-2023","subject":"kyle-kosic","predicate":"held_role","object":{"kind":"entity","entityId":"xai"},"topic":"people","statement":"Ars Technica reported on 12 July 2023 that xAI's website listed Kyle Kosic among the members of its team at launch.","time":{"kind":"snapshot","date":"2023-07-12","note":"Snapshot of the roster shown on xAI's website at launch, as reported."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The record rests on reporting of xAI's launch web page, which was not retrieved directly. Roster membership is not a title or hiring date.","evidenceIds":["lg-ev-mx-kosic-xai-team-2023"],"attributes":{"role":"Launch-team member"}},{"id":"lg-new-shashua-ai21-departure-2026","subject":"amnon-shashua","predicate":"departure_announced","object":{"kind":"entity","entityId":"ai21-labs"},"topic":"governance","statement":"Calcalist reported on 7 July 2026 that Amnon Shashua had informed AI21 Labs of his intention to step down from the company and its board of directors.","time":{"kind":"event","date":"2026-07-07","note":"Date of the report, which is the event this record dates; the report (“Calcalist has learned”) does not say when he informed the company, and no effective date is given."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The record rests on reporting (Calcalist, “has learned”); it is not an AI21 announcement. A reported intention, not a realised departure; stage “announced” marks it as prospective. No reason is recorded.","evidenceIds":["lg-ev-new-shashua-ai21-departure-2026","lg-ev-new-shashua-ai21-departure-2026-cofounder"],"attributes":{"activityStage":"announced","role":"co-founder and board member"}},{"id":"lg-oai-brockman-cofounded-openai","subject":"greg-brockman","predicate":"co_founded","object":{"kind":"entity","entityId":"openai"},"topic":"people","statement":"Greg Brockman posted on X on 6 August 2024 (UTC) that he had co-founded OpenAI nine years earlier.","time":{"kind":"unknown","note":"The post gives no founding date; “9 years ago” in a post of August 2024 is the author’s approximation and is not converted into a date here."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"A retrospective self-description. OpenAI’s 2015 launch announcement names Brockman as CTO (existing record); the post does not establish a legal founder status.","evidenceIds":["lg-ev-oai-brockman-cofounded-openai"]},{"id":"cmp-rsp-v3-3-d6-discretion","subject":"rsp-v3-3","predicate":"states_provision","object":{"kind":"literal","value":"Other exceptions or discretion"},"topic":"governance","statement":"RSP · v3.3 states a provision on the comparison question “Other exceptions or discretion”.","time":{"kind":"event","date":"2026-05-26","basis":"effective","note":"Comparison cell for this edition, dated by the edition’s effective date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Further room for judgement: Appendix A says Anthropic will often have to use its best judgment on whether a competitor scenario applies; Risk Reports may record deviations from described mitigations (§3.2); redactions may be made for listed reasons 'not limited to' those (§3.5); a report is 'significantly redacted' in the judgment of the RSO, CEO, Board or LTBT (§3.6). What the edition states, quoted from the cited expression. It is not evidence of implementation, compliance or effectiveness, and a shared question does not make two editions’ provisions equivalent.","evidenceIds":["ev-cmp-rsp-v3-3-d6-discretion-1","ev-cmp-rsp-v3-3-d6-discretion-2"],"attributes":{"provision":{"kind":"exception","key":"comparison-d6-discretion","facet":{"id":"D6.discretion","status":"stated"}}}},{"id":"cmp-ms-fgf-2026-d6-competitor","subject":"ms-fgf-2026","predicate":"states_provision","object":{"kind":"literal","value":"Provisions conditioned on other developers"},"topic":"governance","statement":"Microsoft FGF · Feb 2026 states a provision on the comparison question “Provisions conditioned on other developers”, in a weaker form than the question’s criterion.","time":{"kind":"event","date":"2026-02","basis":"revision","note":"Comparison cell for this edition, dated by the edition’s revision date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Stated, partly: the passage has what the question’s criterion asks for, but in a weaker form than the criterion’s own words. A marginal-uplift consideration in the risk determination, measured against available tools and open-weights models; it does not state that measures change depending on other developers’ actions. What the edition states, quoted from the cited expression. It is not evidence of implementation, compliance or effectiveness, and a shared question does not make two editions’ provisions equivalent.","evidenceIds":["ev-cmp-ms-fgf-2026-d6-competitor-1"],"attributes":{"provision":{"kind":"exception","key":"comparison-d6-competitor","facet":{"id":"D6.competitor","status":"partly"}}}},{"id":"ap-robin-hanson-hanson-2000-long-term-growth-exponential-modes","subject":"robin-hanson","predicate":"authored","object":{"kind":"entity","entityId":"hanson-2000-long-term-growth-exponential-modes"},"topic":"ideas","statement":"“Long-Term Growth As A Sequence of Exponential Modes” (2000-12) credits Robin Hanson as its author.","time":{"kind":"event","date":"2000-12","basis":"publication","note":"Date the source record gives for this text; authorship is credited in the inspected expression."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Credited authorship of this expression; it says nothing about priority for the ideas discussed.","evidenceIds":["evidence-ap-robin-hanson-hanson-2000-long-term-growth-exponential-modes"]},{"id":"ap-eliezer-yudkowsky-extropians-1997-09-24-yudkowsky","subject":"eliezer-yudkowsky","predicate":"authored","object":{"kind":"entity","entityId":"extropians-1997-09-24-yudkowsky"},"topic":"ideas","statement":"The mailing-list message “Singularity: Generation gap” (1997-09-24) is sent under the name Eliezer S. Yudkowsky.","time":{"kind":"event","date":"1997-09-24","basis":"publication","note":"Date the source record gives for this text; authorship is credited in the inspected expression."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"A sender name on a mailing-list message as archived; it does not establish identity beyond the credited name, and quoted text by others inside the message is not the sender’s.","evidenceIds":["evidence-ap-eliezer-yudkowsky-extropians-1997-09-24-yudkowsky"]},{"id":"ap-eliezer-yudkowsky-lw-2023-gpts-are-predictors-not-imitators","subject":"eliezer-yudkowsky","predicate":"authored","object":{"kind":"entity","entityId":"lw-2023-gpts-are-predictors-not-imitators"},"topic":"ideas","statement":"“GPTs are Predictors, not Imitators” (2023-04-08) credits Eliezer Yudkowsky as its author.","time":{"kind":"event","date":"2023-04-08","basis":"publication","note":"Date the source record gives for this text; authorship is credited in the inspected expression."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Credited authorship of this expression; it says nothing about priority for the ideas discussed.","evidenceIds":["evidence-ap-eliezer-yudkowsky-lw-2023-gpts-are-predictors-not-imitators"]},{"id":"cmp-rsp-v2-1-d2-levels","subject":"rsp-v2-1","predicate":"states_provision","object":{"kind":"literal","value":"Named levels or thresholds"},"topic":"governance","statement":"RSP · v2.1 states a provision on the comparison question “Named levels or thresholds”.","time":{"kind":"event","date":"2025-03-31","basis":"effective","note":"Comparison cell for this edition, dated by the edition’s effective date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Levels are split into labelled Capability Thresholds (capabilities) and ASL Standards (safeguards); §1 (PDF p. 7) describes a Capability Threshold as the trigger for moving up from ASL-N to the ASL-N+1 Standard or higher. ASL-2 and ASL-3 Standards are specified; ASL-4 Standards are referenced as expected requirements to be detailed later. What the edition states, paraphrased from the cited expression with its page. It is not evidence of implementation, compliance or effectiveness, and a shared question does not make two editions’ provisions equivalent.","evidenceIds":["ev-cmp-rsp-v2-1-d2-levels-1","ev-cmp-rsp-v2-1-d2-levels-2"],"attributes":{"provision":{"kind":"threshold","key":"comparison-d2-levels","facet":{"id":"D2.levels","status":"stated"}}}},{"id":"cmp-fsf-2024-d8-process","subject":"fsf-2024","predicate":"states_provision","object":{"kind":"literal","value":"Revision process and approval"},"topic":"governance","statement":"FSF · 2024 states a provision on the comparison question “Revision process and approval”.","time":{"kind":"event","date":"2024-05-17","basis":"publication","note":"Comparison cell for this edition, dated by the edition’s publication date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"No reviewer, approval body or fixed interval is named. What the edition states, paraphrased from the cited expression with its page. It is not evidence of implementation, compliance or effectiveness, and a shared question does not make two editions’ provisions equivalent.","evidenceIds":["ev-cmp-fsf-2024-d8-process-1","ev-cmp-fsf-2024-d8-process-2"],"attributes":{"provision":{"kind":"revision","key":"comparison-d8-process","facet":{"id":"D8.process","status":"stated"}}}},{"id":"cmp-faif-2026-d1-cyber","subject":"faif-2026","predicate":"states_provision","object":{"kind":"literal","value":"Cyber operations"},"topic":"governance","statement":"FAIF · June 2026 edition states a provision on the comparison question “Cyber operations”.","time":{"kind":"event","date":"2026-06-30","basis":"effective","note":"Comparison cell for this edition, dated by the edition’s effective date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"What the edition states, paraphrased from the cited expression with its page. It is not evidence of implementation, compliance or effectiveness, and a shared question does not make two editions’ provisions equivalent.","evidenceIds":["ev-cmp-faif-2026-d1-cyber-1","ev-cmp-faif-2026-d1-cyber-2"],"attributes":{"provision":{"kind":"risk_domain","key":"comparison-d1-cyber","facet":{"id":"D1.cyber","status":"stated"}}}},{"id":"cmp-meta-faf-v1-1-d6-discretion","subject":"meta-faf-v1-1","predicate":"states_provision","object":{"kind":"literal","value":"Other exceptions or discretion"},"topic":"governance","statement":"Meta FAF · v1.1 states a provision on the comparison question “Other exceptions or discretion”.","time":{"kind":"event","date":"2025-02-03","basis":"publication","note":"Comparison cell for this edition, dated by the edition’s publication date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Qualifies the Critical row’s security protections against hacking and exfiltration. The edition also leaves to judgement whether further barriers justify revised threat scenarios (Table 1; §4.2, PDF p. 17) and whether to re-evaluate after a revision (§5.1, PDF p. 19). No general power to override the framework is stated. What the edition states, quoted from the cited expression. It is not evidence of implementation, compliance or effectiveness, and a shared question does not make two editions’ provisions equivalent.","evidenceIds":["ev-cmp-meta-faf-v1-1-d6-discretion-1"],"attributes":{"provision":{"kind":"exception","key":"comparison-d6-discretion","facet":{"id":"D6.discretion","status":"stated"}}}},{"id":"fl-link-ms-fgf-2026-eu-ai-act","subject":"ms-fgf-2026","predicate":"references_commitment","object":{"kind":"entity","entityId":"eu-ai-act-2024"},"topic":"governance","statement":"Microsoft’s Frontier Governance Framework (February 2026) runs a leading indicator assessment on any model in scope for frontier model requirements under applicable laws, naming the EU AI Act among them.","time":{"kind":"event","date":"2026-02","basis":"publication","note":"Month on the cover; a publication day is not established."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The framework names the AI Act to set when an assessment runs. Which Microsoft models are in scope of the Act is legal application and is not recorded. Not evidence of compliance. The same sentence also names California's and New York's laws; its link to SB 53 is recorded separately.","evidenceIds":["evidence-fl-link-ms-fgf-2026-eu-ai-act-1"],"attributes":{"commitment":{"scope":"trigger for the leading indicator assessment","link":"names"}}},{"id":"aib-mod-casp14-other-groups","subject":"aib-doc-casp14-assessment-2021","predicate":"states_provision","object":{"kind":"literal","value":"CASP14: other groups also advanced, and AlphaFold2 did not submit server models"},"topic":"ideas","statement":"Kryshtafovych et al. (Proteins, 7 October 2021) state that although the CASP14 performance is dominated by AlphaFold2, other groups also advanced substantially from CASP13, and that AlphaFold2 did not submit server models.","time":{"kind":"event","date":"2021-10-07","basis":"publication","note":"Date given in PMC's \"Published in final edited form\" line for the organisers' overview paper (kind not stated)."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The CASP organisers' reading of their own comparison plots, in their overview of the round; it is recorded as their statement about participation and relative performance, not as a measurement.","evidenceIds":["evidence-aib-mod-casp14-other-groups-1","evidence-aib-mod-casp14-other-groups-2"],"attributes":{"provision":{"kind":"statement","key":"mod-casp14-other-groups"}}},{"id":"aib-ppl-kohli-alphafold-paper","subject":"aib-pushmeet-kohli","predicate":"authored","object":{"kind":"entity","entityId":"alphafold-paper"},"topic":"ideas","statement":"Pushmeet Kohli is credited as a co-author of Jumper et al., ‘Highly accurate protein structure prediction with AlphaFold’ (Nature, published online 15 July 2021).","time":{"kind":"event","date":"2021-07-15","basis":"publication","note":"Online publication date printed on the Nature article page (Published: 15 July 2021); matches the dataset's dating of the AlphaFold paper."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Co-authorship as credited; not sole credit, and not a statement about any individual's contribution beyond what is quoted.","evidenceIds":["evidence-aib-ppl-kohli-alphafold-paper-1"]},{"id":"kp-states-neural-machine-translation-rare-words-2015-1","subject":"kp-neural-machine-translation-rare-words-2015","predicate":"states_contribution","object":{"kind":"literal","value":"The paper introduces an approach to translating rare and unknown words in neural machine translation by encoding them as sequences of subword units, which it describes as simpler and more effective than back-off dictionaries."},"topic":"ideas","statement":"The paper introduces an approach to translating rare and unknown words in neural machine translation by encoding them as sequences of subword units, which it describes as simpler and more effective than back-off dictionaries.","time":{"kind":"event","date":"2015-08-31","basis":"publication","note":"Date of the arXiv version quoted, submitted 31 August 2015 (UTC); later versions may word it differently."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The paper's own description of its contribution; not an assessment of it.","evidenceIds":["evidence-kp-states-neural-machine-translation-rare-words-2015-1-1"]},{"id":"kp-cites-ernie-3-titan-report-language-models-few-shot-learners-2020","subject":"ernie-3-titan-report","predicate":"cites","object":{"kind":"entity","entityId":"kp-language-models-few-shot-learners-2020"},"topic":"ideas","statement":"ERNIE 3.0 Titan: Exploring Larger-scale Knowledge Enhanced Pre-training for Language Understanding and Generation cites Language Models are Few-Shot Learners.","time":{"kind":"event","date":"2021-12-23","basis":"publication","note":"Date of the citing source as recorded in the dataset; unknown where the dataset has none."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"An explicit reference only; neither agreement nor influence. The citing text does not identify which version of the work was read.","evidenceIds":["evidence-kp-cites-ernie-3-titan-report-language-models-few-shot-learners-2020-1"]},{"id":"kp-cites-qwen-report-improving-language-understanding-by-generative-2018","subject":"qwen-report","predicate":"cites","object":{"kind":"entity","entityId":"kp-improving-language-understanding-by-generative-2018"},"topic":"ideas","statement":"Qwen Technical Report cites Improving Language Understanding by Generative Pre-Training.","time":{"kind":"event","date":"2023-09-28","basis":"publication","note":"Date of the citing source as recorded in the dataset; unknown where the dataset has none."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"An explicit reference only; neither agreement nor influence. The citing text does not identify which version of the work was read.","evidenceIds":["evidence-kp-cites-qwen-report-improving-language-understanding-by-generative-2018-1"]},{"id":"kp-cites-acemoglu-2024-simple-macroeconomics-of-ai-nordhaus-2015-economic-singularity","subject":"acemoglu-2024-simple-macroeconomics-of-ai","predicate":"cites","object":{"kind":"entity","entityId":"nordhaus-2015-economic-singularity"},"topic":"ideas","statement":"The Simple Macroeconomics of AI cites Are We Approaching an Economic Singularity? Information Technology and the Future of Economic Growth.","time":{"kind":"event","date":"2024-05","basis":"publication","note":"Date of the citing source as recorded in the dataset; unknown where the dataset has none."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"An explicit reference only; neither agreement nor influence. The citing text does not identify which version of the work was read.","evidenceIds":["evidence-kp-cites-acemoglu-2024-simple-macroeconomics-of-ai-nordhaus-2015-economic-singularity-1"]},{"id":"kp-authored-jacob-devlin-palm-scaling-language-modeling-pathways-2022","subject":"jacob-devlin","predicate":"authored","object":{"kind":"entity","entityId":"kp-palm-scaling-language-modeling-pathways-2022"},"topic":"ideas","statement":"Jacob Devlin is a credited author of PaLM: Scaling Language Modeling with Pathways.","time":{"kind":"event","date":"2022-04-05","basis":"publication","note":"Date of the work’s earliest recorded version, arXiv version 1, submitted 5 April 2022 (UTC)."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Authorship as credited in the byline of the text read; it implies neither sole authorship nor a role, and no affiliation is recorded.","evidenceIds":["evidence-kp-authored-jacob-devlin-palm-scaling-language-modeling-pathways-2022-1"]},{"id":"kp-authored-oriol-vinyals-distilling-knowledge-neural-network-2015","subject":"oriol-vinyals","predicate":"authored","object":{"kind":"entity","entityId":"kp-distilling-knowledge-neural-network-2015"},"topic":"ideas","statement":"Oriol Vinyals is a credited author of Distilling the Knowledge in a Neural Network.","time":{"kind":"event","date":"2015-03-09","basis":"publication","note":"Date of the work’s earliest recorded version, arXiv version 1, submitted 9 March 2015 (UTC)."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Authorship as credited in the byline of the text read; it implies neither sole authorship nor a role, and no affiliation is recorded.","evidenceIds":["evidence-kp-authored-oriol-vinyals-distilling-knowledge-neural-network-2015-1"]},{"id":"th-authored-mccarthy-review","subject":"john-mccarthy","predicate":"authored","object":{"kind":"entity","entityId":"th-mccarthy-review-question-of-ai"},"topic":"ideas","statement":"John McCarthy is the author named on the review of The Question of Artificial Intelligence hosted on his Stanford pages.","time":{"kind":"unknown","note":"Undated review."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Signature block at the foot of the page.","evidenceIds":["evidence-th-authored-mccarthy-review-1"]},{"id":"th-cn-name-rosenblatt-1958-connectionist","subject":"th-rosenblatt-1958","predicate":"uses_term","object":{"kind":"entity","entityId":"th-fam-connectionism"},"topic":"ideas","statement":"Rosenblatt's 1958 Psychological Review paper says its theory takes the empiricist, or \"connectionist\", position and was developed for a hypothetical nervous system or machine called a perceptron.","time":{"kind":"event","date":"1958","basis":"publication","note":"Date of publication, as the source gives it."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The text's \"connectionist\" names a theoretical position on how information is stored and recognised; the record does not show that the later family name derives from this use.","evidenceIds":["evidence-th-cn-name-rosenblatt-1958-connectionist-1"],"attributes":{"naming":{"string":"connectionist","sense":"meets","role":"use","register":"nonfiction","reading":"text"}}},{"id":"th-sp-def-sandewall-1969","subject":"th-sandewall-1969-heuristic-search","predicate":"discusses","object":{"kind":"entity","entityId":"th-fam-search-planning"},"topic":"ideas","statement":"Sandewall (1969), following Feigenbaum and Feldman (1963), defines a heuristic method as a device that drastically limits search for solutions in large problem spaces.","time":{"kind":"event","date":"1969-05","note":"Dates of the conference the text is associated with, as its proceedings or organiser state them; no retrieved text dates an individual presentation."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The definition is attributed by the paper to Feigenbaum and Feldman (1963), which was not retrieved.","evidenceIds":["evidence-th-sp-def-sandewall-1969-1"],"attributes":{"technical":{"kind":"definition"}}},{"id":"th-term-llm-brants-2007","subject":"th-brants-2007","predicate":"uses_term","object":{"kind":"entity","entityId":"th-term-large-language-model"},"topic":"ideas","statement":"Brants, Popat, Xu, Och and Dean (2007) use \"large language models\" for n-gram language models trained on up to two trillion tokens.","time":{"kind":"event","date":"2007-06","basis":"publication","note":"Date of publication, as the source gives it."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"A located use. It held the earliest-located role in a draft of the candidate pack until the same-family audit found Hu, Turin and Brown (1996). The sense is statistical: n-gram models with up to 300 billion n-grams, not neural networks. The paper uses the phrase as its title and in its conclusion; it does not define it.","evidenceIds":["evidence-th-term-llm-brants-2007-1","evidence-th-term-llm-brants-2007-2","evidence-th-term-llm-brants-2007-3"],"attributes":{"naming":{"string":"large language models","sense":"meets","role":"use","register":"nonfiction","reading":"text"}}},{"id":"c3-stepfun-step5-announcement","subject":"stepfun","predicate":"published","object":{"kind":"entity","entityId":"step-5-preview-announcement"},"topic":"ideas","statement":"StepFun's newsroom post dated 20 September 2026 announced Step 5 Preview as its new flagship model, said it was available in full from that day, and said the model weights would be released on 15 October.","time":{"kind":"event","date":"2026-09-20","basis":"announcement","note":"Date shown on the post as read in the site build file on 29 October 2026; the post's original publication time is not separately verified."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The release of weights on 15 October is a plan stated in this post, recorded as announced; whether and when weights became available is a separate matter (the Hugging Face repository shows weight files from 20 September 2026, but its visibility at that date is not known). 开源 is rendered \"open source\" as the post's own term. Performance claims in the post are out of scope.","evidenceIds":["c3-ev-stepfun-step5-announcement","c3-ev-stepfun-step5-announcement-2"]},{"id":"rd-r02-omohundro-2007-nature-self-improving","subject":"omohundro-2007-nature-self-improving","predicate":"articulates_proposition","object":{"kind":"entity","entityId":"instrumental-convergence"},"topic":"ideas","statement":"Omohundro's paper, dated 5 September 2007 and revised 21 January 2008, argues that self-improving systems will exhibit drives towards efficiency, self-preservation, resource acquisition and creativity, and that these drives are instrumental goals arising from a wide variety of fundamental goals.","time":{"kind":"event","date":"2007-09-05","basis":"publication","note":"Date of publication, as the source gives it."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Earliest located among the texts the searches found (outside the Yudkowsky texts already in the dataset), by the date of the revision read. A statement of the author's argument about rational economic agents, not evidence about any built system; the paper says the drives can be counteracted when another goal outweighs them.","evidenceIds":["evidence-rd-r02-omohundro-2007-nature-self-improving-1","evidence-rd-r02-omohundro-2007-nature-self-improving-2"],"attributes":{"thought":{"roles":["earliest-located"],"register":"nonfiction","claimed":{"date":"2007-09-05","note":"Date of the first version named in the PDF heading."},"attested":{"date":"2008-01-21","note":"The wording is read in the revision of 21 January 2008; the September 2007 version was not compared."}}}},{"id":"rd-r08-gans-2023-not-worried","subject":"gans-2023-not-worried","predicate":"contests_proposition","object":{"kind":"entity","entityId":"loss-of-control-route"},"topic":"ideas","statement":"Gans's blog post of 23 June 2023, written after the Munk debate of that week, argues that even assuming a superintelligent machine emerges, killing humanity would be costly and unnecessary for it, that a rational machine would keep its options open, and that self-improvement poses it control problems that would slow its rise.","time":{"kind":"event","date":"2023-06-23","basis":"publication","note":"Date of posting."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The post calls its own reasoning \"speculation\"; it addresses deliberate killing by a superintelligence and its rapid emergence, not gradual disempowerment.","evidenceIds":["evidence-rd-r08-gans-2023-not-worried-1","evidence-rd-r08-gans-2023-not-worried-2"],"attributes":{"thought":{"roles":["contesting"],"register":"nonfiction","engagement":{"kind":"engages-premise","rationale":"Disputes the premise that a superintelligent system would have reason to kill or rapidly overpower humans."}}}},{"id":"rd-r10b-bengio-2019-instrumental-convergence-thread","subject":"bengio-2019-instrumental-convergence-thread","predicate":"contests_proposition","object":{"kind":"entity","entityId":"control-by-design"},"topic":"ideas","statement":"Bengio's comments in the 2019 thread agree that machines' objectives can be designed and trained, and state that AI systems surpassing human intellectual power could foil attempts at setting objectives that avoid harm, which calls for more research on value alignment.","time":{"kind":"event","date":"2019-10-04","basis":"publication","note":"Dated by the LessWrong copy of 4 October 2019. The Facebook thread follows the Scientific American piece of 26 September 2019; the copy gives no date for individual comments."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Bengio states the possibility as one that is hard to deny, not as a forecast, and says it is probably not near. Each comment is the participant's own words in a relayed copy; the record states what the comment says in this thread, not the author's view at another date.","evidenceIds":["evidence-rd-r10b-bengio-2019-instrumental-convergence-thread-1"],"attributes":{"thought":{"roles":["contesting"],"register":"nonfiction","attested":{"date":"2019-10-04","note":"The wording is known from the LessWrong copy, whose compiler states that he improved formatting and fixed typos; the Facebook original was not compared."},"engagement":{"kind":"engages-premise","rationale":"Gives a reason against the premise that designing a system's objective keeps it controllable: a system more capable than its designers could foil the objectives set for it."}}}}],"sources":[{"id":"source-xai-team-2023","title":"Musk announces new AI company that seeks to “understand the universe”","authors":["Benj Edwards"],"publisher":"Ars Technica","publicationDate":"2023-07-12","version":"Contemporaneous report and screenshot of the launch roster. The current x.ai company page has changed; original archive retrieval was unavailable.","canonicalUrl":"https://arstechnica.com/information-technology/2023/07/musk-announces-new-ai-company-that-seeks-to-understand-the-universe/","evidenceUrl":"https://arstechnica.com/information-technology/2023/07/musk-announces-new-ai-company-that-seeks-to-understand-the-universe/","language":"en","archivedUrl":"https://web.archive.org/web/20260211075334/https://arstechnica.com/information-technology/2023/07/musk-announces-new-ai-company-that-seeks-to-understand-the-universe/","archivedAt":"2026-02-11","accessedAt":"2026-09-18","reuse":{"attribution":"Benj Edwards, Musk announces new AI company that seeks to “understand the universe” (2023-07-12).","licence":"No open redistribution licence asserted","note":"Bibliographic metadata and brief attributed paraphrases or excerpts only. Source roles are relative to each claim."}},{"id":"source-rsp-2-1","documentId":"rsp-v2-1","title":"Responsible Scaling Policy — v2.1","authors":["Anthropic"],"publisher":"Anthropic","publisherId":"anthropic","publicationDate":null,"version":"Responsible Scaling Policy v2.1; effective date 2025-03-31.","versionDate":"2025-03-31","canonicalUrl":"https://www-cdn.anthropic.com/17310f6d70ae5627f55313ed067afc1a762a4068.pdf","evidenceUrl":"https://www-cdn.anthropic.com/17310f6d70ae5627f55313ed067afc1a762a4068.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20250402134435/https://www-cdn.anthropic.com/17310f6d70ae5627f55313ed067afc1a762a4068.pdf","archivedAt":"2025-04-02","accessedAt":"2026-09-18","reuse":{"attribution":"Anthropic, Responsible Scaling Policy — v2.1.","licence":"No open redistribution licence asserted","note":"Selekoa practice: metadata, attributed paraphrases and short attributed quotations under the editorial policy (at most 50 words each; at most 400 quoted words per document across the dataset, and about 10% of a document under about 2,000 words). Documents are linked externally, not redistributed. Publisher terms that forbid quotation override this practice."}},{"id":"source-rsp-3-3","documentId":"rsp-v3-3","title":"Responsible Scaling Policy — v3.3","authors":["Anthropic"],"publisher":"Anthropic","publisherId":"anthropic","publicationDate":null,"version":"Responsible Scaling Policy v3.3; effective date 2026-05-26.","versionDate":"2026-05-26","canonicalUrl":"https://cdn.sanity.io/files/4zrzovbb/website/c11e84981d0a7281a1b229f3fa6af0da66eaf43f.pdf","evidenceUrl":"https://cdn.sanity.io/files/4zrzovbb/website/c11e84981d0a7281a1b229f3fa6af0da66eaf43f.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20260528170023/https://cdn.sanity.io/files/4zrzovbb/website/c11e84981d0a7281a1b229f3fa6af0da66eaf43f.pdf","archivedAt":"2026-05-28","accessedAt":"2026-09-18","reuse":{"attribution":"Anthropic, Responsible Scaling Policy — v3.3.","licence":"No open redistribution licence asserted","note":"Selekoa practice: metadata, attributed paraphrases and short attributed quotations under the editorial policy (at most 50 words each; at most 400 quoted words per document across the dataset, and about 10% of a document under about 2,000 words). Documents are linked externally, not redistributed. Publisher terms that forbid quotation override this practice."}},{"id":"source-fsf-1-0","documentId":"fsf-2024","title":"Frontier Safety Framework — v1.0","authors":["Google DeepMind"],"publisher":"Google DeepMind","publisherId":"google-deepmind","publicationDate":"2024-05-17","version":"Frontier Safety Framework v1.0; publication date 2024-05-17.","versionDate":"2024-05-17","canonicalUrl":"https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/introducing-the-frontier-safety-framework/fsf-technical-report.pdf","evidenceUrl":"https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/introducing-the-frontier-safety-framework/fsf-technical-report.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20240517140902/https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/introducing-the-frontier-safety-framework/fsf-technical-report.pdf","archivedAt":"2024-05-17","accessedAt":"2026-09-18","reuse":{"attribution":"Google DeepMind, Frontier Safety Framework — v1.0.","licence":"No open redistribution licence asserted","note":"Selekoa practice: metadata, attributed paraphrases and short attributed quotations under the editorial policy (at most 50 words each; at most 400 quoted words per document across the dataset, and about 10% of a document under about 2,000 words). Documents are linked externally, not redistributed. Publisher terms that forbid quotation override this practice."}},{"id":"source-fsf-2-0","documentId":"fsf-v2-0","title":"Frontier Safety Framework — v2.0","authors":["Google DeepMind"],"publisher":"Google DeepMind","publisherId":"google-deepmind","publicationDate":"2025-02-04","version":"Frontier Safety Framework v2.0; publication date 2025-02-04.","versionDate":"2025-02-04","canonicalUrl":"https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/updating-the-frontier-safety-framework/Frontier%20Safety%20Framework%202.0.pdf","evidenceUrl":"https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/updating-the-frontier-safety-framework/Frontier%20Safety%20Framework%202.0.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20250205011727/https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/updating-the-frontier-safety-framework/Frontier%20Safety%20Framework%202.0.pdf","archivedAt":"2025-02-05","accessedAt":"2026-09-18","reuse":{"attribution":"Google DeepMind, Frontier Safety Framework — v2.0.","licence":"No open redistribution licence asserted","note":"Selekoa practice: metadata, attributed paraphrases and short attributed quotations under the editorial policy (at most 50 words each; at most 400 quoted words per document across the dataset, and about 10% of a document under about 2,000 words). Documents are linked externally, not redistributed. Publisher terms that forbid quotation override this practice."}},{"id":"source-faif-2026","documentId":"faif-2026","title":"Frontier Artificial Intelligence Framework — June 2026 edition","authors":["xAI"],"publisher":"xAI","publisherId":"xai","publicationDate":null,"version":"Frontier Artificial Intelligence Framework June 2026 edition; effective date 2026-06-30. Visible public cover identifies the effective edition; stale embedded PDF draft metadata is not used to infer publication status.","versionDate":"2026-06-30","canonicalUrl":"https://media.x.ai/v1/website/xai-frontier-artificial-intelligence-framework-30-june-2026-99c40684.pdf","evidenceUrl":"https://media.x.ai/v1/website/xai-frontier-artificial-intelligence-framework-30-june-2026-99c40684.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20260716003429/https://media.x.ai/v1/website/xai-frontier-artificial-intelligence-framework-30-june-2026-99c40684.pdf","archivedAt":"2026-07-16","accessedAt":"2026-09-18","reuse":{"attribution":"xAI, Frontier Artificial Intelligence Framework — June 2026 edition.","licence":"No open redistribution licence asserted","note":"Selekoa practice: metadata, attributed paraphrases and short attributed quotations under the editorial policy (at most 50 words each; at most 400 quoted words per document across the dataset, and about 10% of a document under about 2,000 words). Documents are linked externally, not redistributed. Publisher terms that forbid quotation override this practice."}},{"id":"source-oracle-stargate-2025","title":"Stargate advances with 4.5 GW partnership with Oracle","authors":["OpenAI"],"publisher":"OpenAI","publisherId":"openai","publicationDate":"2025-07-22","version":"Dated announcement inspected 2026-09-19; a historical company statement, not independent verification of implementation. Archived copy: the Wayback Machine capture of 2025-07-22 11:51:19 UTC, the earliest same-day capture found by a bounded search, read by a cross-family machine check on 2026-10-26.","canonicalUrl":"https://openai.com/index/stargate-advances-with-partnership-with-oracle/","evidenceUrl":"https://openai.com/index/stargate-advances-with-partnership-with-oracle/","language":"en","archivedUrl":"https://web.archive.org/web/20250722115119/https://openai.com/index/stargate-advances-with-partnership-with-oracle/","archivedAt":"2025-07-22","accessedAt":"2026-09-19","reuse":{"attribution":"OpenAI, Stargate advances with 4.5 GW partnership with Oracle (2025-07-22).","licence":"No open redistribution licence asserted","note":"Bibliographic metadata and editorial paraphrases only; no full source redistributed."}},{"id":"source-atlas-alphafold-paper","documentId":"alphafold-paper","title":"Highly accurate protein structure prediction with AlphaFold","authors":["John Jumper","Richard Evans","Alexander Pritzel","Tim Green","Michael Figurnov","Olaf Ronneberger","Kathryn Tunyasuvunakool","Russ Bates","Augustin Žídek","Anna Potapenko","Alex Bridgland","Clemens Meyer","Simon A. A. Kohl","Andrew J. Ballard","Andrew Cowie","Bernardino Romera-Paredes","Stanislav Nikolov","Rishub Jain","Jonas Adler","Trevor Back","Stig Petersen","David Reiman","Ellen Clancy","Michal Zielinski","Martin Steinegger","Michalina Pacholska","Tamas Berghammer","Sebastian Bodenstein","David Silver","Oriol Vinyals","Andrew W. Senior","Koray Kavukcuoglu","Pushmeet Kohli","Demis Hassabis"],"publisher":"Nature","publicationDate":"2021-07-15","version":"Nature 596, 583–589 (2021), DOI 10.1038/s41586-021-03819-2; version of record HTML.","canonicalUrl":"https://www.nature.com/articles/s41586-021-03819-2","evidenceUrl":"https://www.nature.com/articles/s41586-021-03819-2","language":"en","archivedUrl":"https://web.archive.org/web/20260923202227/https://www.nature.com/articles/s41586-021-03819-2","archivedAt":"2026-09-23","accessedAt":"2026-09-28","reuse":{"attribution":"John Jumper; Richard Evans; Alexander Pritzel; et al.. Highly accurate protein structure prediction with AlphaFold.","licence":"No redistribution licence asserted.","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-xm-open-strategy","documentId":"meta-open-strategy-2024","title":"Open Source AI Is the Path Forward","authors":["Mark Zuckerberg"],"publisher":"Meta","publisherId":"meta","publicationDate":"2024-07-23","version":"July 23, 2024 essay with January 27, 2025 update shown.","canonicalUrl":"https://about.fb.com/news/2024/07/open-source-ai-is-the-path-forward/","evidenceUrl":"https://about.fb.com/news/2024/07/open-source-ai-is-the-path-forward/","language":"en","archivedUrl":"https://web.archive.org/web/20260923150356/https://about.fb.com/news/2024/07/open-source-ai-is-the-path-forward/","archivedAt":"2026-09-23","accessedAt":"2026-09-29","reuse":{"attribution":"Open Source AI Is the Path Forward — Meta","licence":"No redistribution licence asserted.","note":"Source-linked metadata and brief evidence paraphrases; original text remains with its publisher."}},{"id":"source-cn-qwen","title":"Qwen Technical Report","authors":["Jinze Bai","Shuai Bai","Yunfei Chu","Zeyu Cui","Kai Dang","Xiaodong Deng","Yang Fan","Wenbin Ge","Yu Han","Fei Huang","Binyuan Hui","Luo Ji","Mei Li","Junyang Lin","Runji Lin","Dayiheng Liu","Gao Liu","Chengqiang Lu","Keming Lu","Jianxin Ma","Rui Men","Xingzhang Ren","Xuancheng Ren","Chuanqi Tan","Sinan Tan","Jianhong Tu","Peng Wang","Shijie Wang","Wei Wang","Shengguang Wu","Benfeng Xu","Jin Xu","An Yang","Hao Yang","Jian Yang","Shusheng Yang","Yang Yao","Bowen Yu","Hongyi Yuan","Zheng Yuan","Jianwei Zhang","Xingxuan Zhang","Yichang Zhang","Zhenru Zhang","Chang Zhou","Jingren Zhou","Xiaohuan Zhou","Tianhang Zhu"],"publisher":"Qwen Team, Alibaba Group","publicationDate":"2023-09-28","version":"Source language: English (en). arXiv:2309.16609v1; fixed first version.","canonicalUrl":"https://arxiv.org/html/2309.16609v1","evidenceUrl":"https://arxiv.org/html/2309.16609v1","language":"en","accessedAt":"2026-09-29","reuse":{"attribution":"Qwen Team, Alibaba Group, Qwen Technical Report (2023-09-28).","licence":"No redistribution licence asserted for this source expression","note":"Bibliographic metadata and brief attributed paraphrases only; model licensing is distinct from source-document reuse."}},{"id":"source-meta-faf-v1-1","documentId":"meta-faf-v1-1","title":"Frontier AI Framework — Version 1.1","authors":["Meta"],"publisher":"Meta","publisherId":"meta","publicationDate":"2025-02-03","version":"Frontier AI Framework, Version 1.1, as captured by the Internet Archive on 2025-02-13, the earliest complete capture located. The original address has returned HTTP 500 since April 2026; a revised expression under the same label was captured from 2025-03-28 and is recorded separately.","versionDate":"2025-02-03","canonicalUrl":"https://ai.meta.com/static-resource/meta-frontier-ai-framework/","evidenceUrl":"https://web.archive.org/web/20250213105620/https://ai.meta.com/static-resource/meta-frontier-ai-framework/","language":"en","archivedUrl":"https://web.archive.org/web/20250213105620/https://ai.meta.com/static-resource/meta-frontier-ai-framework/","archivedAt":"2025-02-13","accessedAt":"2026-10-03","reuse":{"attribution":"Meta, Frontier AI Framework, Version 1.1 (2025).","licence":"No open redistribution licence asserted","note":"Selekoa practice: metadata, attributed paraphrases and short attributed quotations under the editorial policy (at most 50 words each; at most 400 quoted words per document across the dataset, and about 10% of a document under about 2,000 words). Documents are linked externally, not redistributed. Publisher terms that forbid quotation override this practice."}},{"id":"source-ms-fgf-2026","documentId":"ms-fgf-2026","title":"Frontier Governance Framework — February 2026","authors":["Microsoft"],"publisher":"Microsoft","publisherId":"microsoft","publicationDate":null,"version":"Frontier Governance Framework, February 2026 edition (change log entry dated February 2026). The file served at the recorded address (last modified 2026-03-24) is byte-identical to the Internet Archive capture of 2026-04-24, the earliest located; a separate publication date was not established.","versionDate":"2026-02","canonicalUrl":"https://cdn-dynmedia-1.microsoft.com/is/content/microsoftcorp/microsoft/msc/documents/presentations/CSR/Frontier-Governance-Framework-Feb-2026.pdf","evidenceUrl":"https://cdn-dynmedia-1.microsoft.com/is/content/microsoftcorp/microsoft/msc/documents/presentations/CSR/Frontier-Governance-Framework-Feb-2026.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20260424000716/https://cdn-dynmedia-1.microsoft.com/is/content/microsoftcorp/microsoft/msc/documents/presentations/CSR/Frontier-Governance-Framework-Feb-2026.pdf","archivedAt":"2026-04-24","accessedAt":"2026-10-03","reuse":{"attribution":"Microsoft, Frontier Governance Framework (February 2026).","licence":"No open redistribution licence asserted","note":"Selekoa practice: metadata, attributed paraphrases and short attributed quotations under the editorial policy (at most 50 words each; at most 400 quoted words per document across the dataset, and about 10% of a document under about 2,000 words). Documents are linked externally, not redistributed. Publisher terms that forbid quotation override this practice."}},{"id":"source-turing-c1951-amt-b-4","documentId":"turing-c1951-heretical-theory","title":"Intelligent Machinery, a Heretical Theory (AMT/B/4)","authors":["Alan M. Turing"],"publisher":"The Turing Digital Archive, King’s College, Cambridge","publicationDate":null,"version":"Archive scans of the carbon (p. 101, AMT/B/4/6) and the typescript (p. 10, AMT/B/4/16); the concluding paragraph read on both images for this collection. The carbon carries a typed insertion and a manuscript correction nearby.","canonicalUrl":"https://turingarchive.kings.cam.ac.uk/publications-lectures-and-talks-amtb/amt-b-4","evidenceUrl":"https://turingarchive.kings.cam.ac.uk/publications-lectures-and-talks-amtb/amt-b-4","language":"en","archivedUrl":"https://web.archive.org/web/20230511002039/https://mediadepot.kings.cam.ac.uk/getmedia/61/be4a3d910d5d58e3911315113c60a09f6293fa896a5e3795998fa6b4fb72b71446336e3c7c92d5e08fd0fb2762b6f663279ba799d7fd562480b4bf63c63e02b9","archivedAt":"2023-05-11","accessedAt":"2026-10-06","reuse":{"attribution":"Alan M. Turing, \"Intelligent Machinery, a Heretical Theory\", typescript, Turing Digital Archive AMT/B/4, King’s College, Cambridge.","licence":"No open redistribution licence asserted; archive scans are provided for research. Page images are not reproduced.","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-extropians-1997-09-24-yudkowsky","documentId":"extropians-1997-09-24-yudkowsky","title":"Singularity: Generation gap (Extropians mailing list)","authors":["Eliezer S. Yudkowsky"],"publisher":"Extropians mailing list","publicationDate":"1997-09-24","version":"Archive HTML as served, retrieved 2026-10-06 with the hash recorded by the 1996–2022 candidate search; quoted lines excluded when reading the author’s text. Archive at extropians.weidai.com.","canonicalUrl":"http://extropians.weidai.com/extropians.3Q97/4352.html","evidenceUrl":"http://extropians.weidai.com/extropians.3Q97/4352.html","language":"en","archivedUrl":"https://web.archive.org/web/20150308055632/http://extropians.weidai.com/extropians.3Q97/4352.html","archivedAt":"2015-03-08","accessedAt":"2026-10-06","reuse":{"attribution":"Eliezer S. Yudkowsky, \"Singularity: Generation gap\", Extropians mailing list, 1997-09-24.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-vc-comments-2000-capture","documentId":"more-1998-singularity-meets-economy","title":"Comments on Vinge’s Singularity","authors":["Max More"],"publisher":"Robin Hanson (collection for Extropy Online)","publicationDate":"1998","version":"Raw Internet Archive capture of 2000-08-17, the earliest listed for the page, retrieved 2026-10-06; the current page was also retrieved, with the hash recorded by the 1996–2022 candidate search. Kept on hanson.gmu.edu.","canonicalUrl":"https://mason.gmu.edu/~rhanson/vc.html","evidenceUrl":"https://web.archive.org/web/20000817213702/http://hanson.gmu.edu/vc.html","language":"en","archivedUrl":"https://web.archive.org/web/20000817213702/http://hanson.gmu.edu/vc.html","archivedAt":"2000-08-17","accessedAt":"2026-10-06","reuse":{"attribution":"Max More, \"Singularity Meets Economy\", in Comments on Vinge’s Singularity (1998).","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-christiano-2022-where-i-agree-and-disagree","documentId":"christiano-2022-where-i-agree-and-disagree","title":"Where I agree and disagree with Eliezer","authors":["Paul Christiano"],"publisher":"Alignment Forum and LessWrong","publicationDate":"2022-06-19","version":"Text checked in the post’s first stored version through the LessWrong GraphQL API on 2026-10-06.","canonicalUrl":"https://www.lesswrong.com/posts/CoZhXrhpQxpy9xw9y/where-i-agree-and-disagree-with-eliezer","evidenceUrl":"https://www.lesswrong.com/posts/CoZhXrhpQxpy9xw9y/where-i-agree-and-disagree-with-eliezer","language":"en","archivedUrl":"https://web.archive.org/web/20220619200048/https://www.lesswrong.com/posts/CoZhXrhpQxpy9xw9y/where-i-agree-and-disagree-with-eliezer","archivedAt":"2022-06-19","accessedAt":"2026-10-06","reuse":{"attribution":"Paul Christiano, \"Where I agree and disagree with Eliezer\", Alignment Forum and LessWrong, 2022-06-19.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-lw-2023-gpts-are-predictors-not-imitators","documentId":"lw-2023-gpts-are-predictors-not-imitators","title":"GPTs are Predictors, not Imitators","authors":["Eliezer Yudkowsky"],"publisher":"LessWrong","publicationDate":"2023-04-08","version":"Post body retrieved through the LessWrong GraphQL API on 2026-10-06 (SHA-256 24a41ca1ec6d0276008e11e705db91b8a645ad70bc2fcad1245ca1a597f5528a), content version 1.1.0; quotations also compared with the posting-day version 1.0.0.","canonicalUrl":"https://www.lesswrong.com/posts/nH4c3Q9t9F3nJ7y8W/gpts-are-predictors-not-imitators","evidenceUrl":"https://www.lesswrong.com/posts/nH4c3Q9t9F3nJ7y8W/gpts-are-predictors-not-imitators","language":"en","archivedUrl":"https://web.archive.org/web/20260930171831/https://www.lesswrong.com/posts/nH4c3Q9t9F3nJ7y8W/gpts-are-predictors-not-imitators","archivedAt":"2026-09-30","accessedAt":"2026-10-06","reuse":{"attribution":"Eliezer Yudkowsky, “GPTs are Predictors, not Imitators”, LessWrong, 2023-04-08.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-hanson-2000-long-term-growth-exponential-modes","documentId":"hanson-2000-long-term-growth-exponential-modes","title":"Long-Term Growth As A Sequence of Exponential Modes","authors":["Robin Hanson"],"publisher":"Working paper, George Mason University (submitted to Journal of Economic Behavior & Organization per the author's December 2000 vita)","publicationDate":"2000-12","version":"Wayback capture of http://hanson.gmu.edu/longgrow.pdf. Capture retrieved 2026-10-08 (SHA-256 bb301fd8c1b699aa30e04e80a3a06ebfedcd31a9658077a0a3898df305e3cf11). Versions: first version (1998-09 (title page)): not retrieved; working paper (2000-12): checked. Published version: Hanson, R. (2000). Long-term growth as a sequence of exponential modes [Working paper]. Department of Economics, George Mason University. No published version located (Crossref search 2026-10-10 found none).","canonicalUrl":"https://mason.gmu.edu/~rhanson/longgrow.pdf","evidenceUrl":"https://web.archive.org/web/20011128144942/http://hanson.gmu.edu/longgrow.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20011128144942/http://hanson.gmu.edu/longgrow.pdf","archivedAt":"2001-11-28","accessedAt":"2026-10-08","reuse":{"attribution":"Robin Hanson, “Long-Term Growth As A Sequence of Exponential Modes”, Working paper, George Mason University (submitted to Journal of Economic Behavior & Organization per the author's December 2000 vita), 2000-12.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-davidson-2021-explosive-economic-growth","documentId":"davidson-2021-explosive-economic-growth","title":"Could Advanced AI Drive Explosive Economic Growth?","authors":["Tom Davidson"],"publisher":"Open Philanthropy research report","publicationDate":"2021-06-25","version":"Wayback capture of openphilanthropy.org/could-advanced-ai-drive-explosive-economic-growth (2021-07-02); compared with the 2022 capture of the moved page. Capture retrieved 2026-10-08 (SHA-256 b49aea65d3574a88e914a855aaba57dd4a02728159a187a26a657d0f44ac324b). Published version: Davidson, T. (2021, June 25). Could advanced AI drive explosive economic growth? Open Philanthropy. Report; no other published version recorded.","canonicalUrl":"https://www.openphilanthropy.org/could-advanced-ai-drive-explosive-economic-growth","evidenceUrl":"https://web.archive.org/web/20210702003241/https://www.openphilanthropy.org/could-advanced-ai-drive-explosive-economic-growth","language":"en","archivedUrl":"https://web.archive.org/web/20210702003241/https://www.openphilanthropy.org/could-advanced-ai-drive-explosive-economic-growth","archivedAt":"2021-07-02","accessedAt":"2026-10-08","reuse":{"attribution":"Tom Davidson, “Could Advanced AI Drive Explosive Economic Growth?”, Open Philanthropy research report, 2021-06-25.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-krueger-1991-computers-wage-structure","documentId":"krueger-1991-computers-wage-structure","title":"How Computers Have Changed the Wage Structure: Evidence from Microdata, 1984-89","authors":["Alan B. Krueger"],"publisher":"NBER Working Paper 3858","publicationDate":"1991-10","version":"Full text (scanned, OCR text layer with errors). Current copy retrieved directly on 2026-10-09; no archive capture (Wayback unreachable), so earlier bytes are not authenticated. SHA-256 8d9b08fbad59733e3d0674bb8a76cb253e99a8f8d9cda4bedab8b05fdcbd0481. Journal version not retrieved. Krueger, A. B. (1993). How computers have changed the wage structure: Evidence from microdata, 1984–1989. The Quarterly Journal of Economics, 108(1), 33–60. https://doi.org/10.2307/2118494","canonicalUrl":"https://www.nber.org/system/files/working_papers/w3858/w3858.pdf","evidenceUrl":"https://www.nber.org/system/files/working_papers/w3858/w3858.pdf","language":"en","accessedAt":"2026-10-09","reuse":{"attribution":"Alan B. Krueger, “How Computers Have Changed the Wage Structure: Evidence from Microdata, 1984-89”, NBER Working Paper 3858, 1991-10.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-nordhaus-2015-nber","documentId":"nordhaus-2015-economic-singularity","title":"Are We Approaching an Economic Singularity? Information Technology and the Future of Economic Growth","authors":["William D. Nordhaus"],"publisher":"NBER Working Paper 21547","publicationDate":"2015-09","version":"Full text. Current copy retrieved directly on 2026-10-09; no archive capture (Wayback unreachable), so earlier bytes are not authenticated. SHA-256 cb481e5e99ef9bad8575d9150bcc8464eda4904722cc5048389ab6159858b062. Journal version not retrieved. Nordhaus, W. D. (2021). Are we approaching an economic singularity? Information technology and the future of economic growth. American Economic Journal: Macroeconomics, 13(1), 299–332. https://doi.org/10.1257/mac.20170105","canonicalUrl":"https://www.nber.org/system/files/working_papers/w21547/w21547.pdf","evidenceUrl":"https://www.nber.org/system/files/working_papers/w21547/w21547.pdf","language":"en","accessedAt":"2026-10-09","reuse":{"attribution":"William D. Nordhaus, “Are We Approaching an Economic Singularity? Information Technology and the Future of Economic Growth”, NBER Working Paper 21547, 2015-09.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-acemoglu-restrepo-2016-race-between-machine-and-man","documentId":"acemoglu-restrepo-2016-race-between-machine-and-man","title":"The Race Between Machine and Man: Implications of Technology for Growth, Factor Shares and Employment","authors":["Daron Acemoglu","Pascual Restrepo"],"publisher":"NBER Working Paper 22252","publicationDate":"2016-05","version":"Full text (revised version). Current copy retrieved directly on 2026-10-09; no archive capture (Wayback unreachable), so earlier bytes are not authenticated. SHA-256 441d01202afd56ef8002fc24ffc2beb51191741c0b5accb11d2534620dd616b7. Journal version not retrieved. Acemoglu, D., & Restrepo, P. (2018). The race between man and machine: Implications of technology for growth, factor shares, and employment. American Economic Review, 108(6), 1488–1542. https://doi.org/10.1257/aer.20160696","canonicalUrl":"https://www.nber.org/system/files/working_papers/w22252/w22252.pdf","evidenceUrl":"https://www.nber.org/system/files/working_papers/w22252/w22252.pdf","language":"en","accessedAt":"2026-10-09","reuse":{"attribution":"Daron Acemoglu, Pascual Restrepo, “The Race Between Machine and Man: Implications of Technology for Growth, Factor Shares and Employment”, NBER Working Paper 22252, 2016-05.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-agrawal-gans-goldfarb-2018-prediction-judgment-complexity","documentId":"agrawal-gans-goldfarb-2018-prediction-judgment-complexity","title":"Prediction, Judgment and Complexity: A Theory of Decision Making and Artificial Intelligence","authors":["Ajay K. Agrawal","Joshua S. Gans","Avi Goldfarb"],"publisher":"NBER Working Paper 24243","publicationDate":"2018-01","version":"Full text. Current copy retrieved directly on 2026-10-09; no archive capture (Wayback unreachable), so earlier bytes are not authenticated. SHA-256 64e4872abaea128fc37382d098bc0d4a5662fbdad641e38e010210169158a5ad.","canonicalUrl":"https://www.nber.org/system/files/working_papers/w24243/w24243.pdf","evidenceUrl":"https://www.nber.org/system/files/working_papers/w24243/w24243.pdf","language":"en","accessedAt":"2026-10-09","reuse":{"attribution":"Ajay K. Agrawal, Joshua S. Gans, Avi Goldfarb, “Prediction, Judgment and Complexity: A Theory of Decision Making and Artificial Intelligence”, NBER Working Paper 24243, 2018-01.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-acemoglu-restrepo-2019-automation-and-new-tasks","documentId":"acemoglu-restrepo-2019-automation-and-new-tasks","title":"Automation and New Tasks: How Technology Displaces and Reinstates Labor","authors":["Daron Acemoglu","Pascual Restrepo"],"publisher":"NBER Working Paper 25684","publicationDate":"2019-03","version":"Full text. Current copy retrieved directly on 2026-10-09; no archive capture (Wayback unreachable), so earlier bytes are not authenticated. SHA-256 7757f77583c186dbbd0945e81e286fbb3ec35ed4e633ce65b2bb22f9f1bec490. Journal version not retrieved. Acemoglu, D., & Restrepo, P. (2019). Automation and new tasks: How technology displaces and reinstates labor. Journal of Economic Perspectives, 33(2), 3–30. https://doi.org/10.1257/jep.33.2.3","canonicalUrl":"https://www.nber.org/system/files/working_papers/w25684/w25684.pdf","evidenceUrl":"https://www.nber.org/system/files/working_papers/w25684/w25684.pdf","language":"en","accessedAt":"2026-10-09","reuse":{"attribution":"Daron Acemoglu, Pascual Restrepo, “Automation and New Tasks: How Technology Displaces and Reinstates Labor”, NBER Working Paper 25684, 2019-03.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-acemoglu-2024-nber","documentId":"acemoglu-2024-simple-macroeconomics-of-ai","title":"The Simple Macroeconomics of AI","authors":["Daron Acemoglu"],"publisher":"NBER Working Paper 32487","publicationDate":"2024-05","version":"Full text. Current copy retrieved directly on 2026-10-09; no archive capture (Wayback unreachable), so earlier bytes are not authenticated. SHA-256 ffb04f119539228da2db0699530425e56e815c890b6ebe7b5c932675e2eebdb0. Journal version not retrieved. Acemoglu, D. (2025). The simple macroeconomics of AI. Economic Policy, 40(121), 13–58. https://doi.org/10.1093/epolic/eiae042","canonicalUrl":"https://www.nber.org/system/files/working_papers/w32487/w32487.pdf","evidenceUrl":"https://www.nber.org/system/files/working_papers/w32487/w32487.pdf","language":"en","accessedAt":"2026-10-09","reuse":{"attribution":"Daron Acemoglu, “The Simple Macroeconomics of AI”, NBER Working Paper 32487, 2024-05.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-nilsson-1984-ai-employment-and-income","documentId":"nilsson-1984-ai-employment-and-income","title":"Artificial Intelligence, Employment, and Income","authors":["Nils J. Nilsson"],"publisher":"AI Magazine 5(2), Summer 1984","publicationDate":"1984","version":"Full text (scanned, OCR text layer). Current copy retrieved directly on 2026-10-09; no archive capture (Wayback unreachable), so earlier bytes are not authenticated. SHA-256 4dc8b541e4bd22bbc54c146a7e8c748f9f16a835d1b256e026f521c4462d3418.","canonicalUrl":"https://ojs.aaai.org/aimagazine/index.php/aimagazine/article/download/433/369","evidenceUrl":"https://ojs.aaai.org/aimagazine/index.php/aimagazine/article/download/433/369","language":"en","archivedUrl":"https://web.archive.org/web/20250614043636/https://ojs.aaai.org/aimagazine/index.php/aimagazine/article/download/433/369","archivedAt":"2025-06-14","accessedAt":"2026-10-09","reuse":{"attribution":"Nils J. Nilsson, “Artificial Intelligence, Employment, and Income”, AI Magazine 5(2), Summer 1984, 1984.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-gans-2023-socially-minded-governance-agi","documentId":"gans-2023-socially-minded-governance-agi","title":"Can Socially-Minded Governance Control the AGI Beast?","authors":["Joshua S. Gans"],"publisher":"NBER Working Paper 31924","publicationDate":"2023-11","version":"Current copy (NBER PDF), no archive capture compared. Retrieved 2026-10-11. SHA-256 3925302d6dd99aefc50cf3c959abd81aebbd5086d7f7364b8ded6bd364c6e8e4.","canonicalUrl":"https://www.nber.org/system/files/working_papers/w31924/w31924.pdf","evidenceUrl":"https://www.nber.org/system/files/working_papers/w31924/w31924.pdf","language":"en","accessedAt":"2026-10-11","reuse":{"attribution":"Joshua S. Gans, “Can Socially-Minded Governance Control the AGI Beast?”, NBER Working Paper 31924, 2023-11.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"lg-src-new-calcalist-shashua","title":"Amnon Shashua to leave AI21 after nine years","authors":["Meir Orbach"],"publisher":"Calcalist (Ctech)","publicationDate":"2026-07-07","version":"Dated page, retrieved on 2026-10-15 (SHA-256 8f4c0b137e866cea36810276e520f3d9298b2b99eabc889f86bb6fccde1ab2ba) directly from the publisher.","canonicalUrl":"https://www.calcalistech.com/ctechnews/article/r1eabd5qfl","evidenceUrl":"https://www.calcalistech.com/ctechnews/article/r1eabd5qfl","language":"en","archivedUrl":"https://web.archive.org/web/20261014210052/https://www.calcalistech.com/ctechnews/article/r1eabd5qfl","archivedAt":"2026-10-14","accessedAt":"2026-10-15","reuse":{"attribution":"Meir Orbach, “Amnon Shashua to leave AI21 after nine years”, 2026-07-07.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"lg-src-oai-brockman-x-2024","title":"Post of 6 August 2024 (UTC) on taking a sabbatical","authors":["Greg Brockman"],"publisher":"X","publicationDate":"2024-08-06","version":"Dated post, retrieved on 2026-10-15 (SHA-256 15faa9138707850a03128bd52e3ed4d2aefc75b21c2d76548d1ab7006ed3d5ab) through X’s own syndication endpoint for the post’s text, which truncates long notes. Read through X’s syndication endpoint (text only). Publication date is the post’s UTC timestamp.","canonicalUrl":"https://x.com/gdb/status/1820644694264791459","evidenceUrl":"https://x.com/gdb/status/1820644694264791459","language":"en","archivedUrl":"https://web.archive.org/web/20261011233817/https://x.com/gdb/status/1820644694264791459","archivedAt":"2026-10-11","accessedAt":"2026-10-15","reuse":{"attribution":"Greg Brockman, “Post of 6 August 2024 (UTC) on taking a sabbatical”, 2024-08-06.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"c2-src-ernie3-titan-arxiv-v1","title":"ERNIE 3.0 Titan: Exploring Larger-scale Knowledge Enhanced Pre-training for Language Understanding and Generation","authors":["Shuohuan Wang","Yu Sun","Yang Xiang"],"publisher":"arXiv","publicationDate":"2021-12-23","version":"Dated document, retrieved on 2026-10-27 (SHA-256 cb22312dce198f418286264665a60f22d5f09dc9335080d246b0605ac4d8d0a4) directly from the publisher. Version: 2112.12731v1. Version 1 as submitted on 23 December 2021. The author list gives the first credited authors only; see the document for the full list.","canonicalUrl":"https://arxiv.org/pdf/2112.12731v1","evidenceUrl":"https://arxiv.org/pdf/2112.12731v1","language":"en","accessedAt":"2026-10-27","reuse":{"attribution":"Shuohuan Wang, Yu Sun, Yang Xiang, “ERNIE 3.0 Titan: Exploring Larger-scale Knowledge Enhanced Pre-training for Language Understanding and Generation”, 2021-12-23.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-aib-casp14-assessment","documentId":"aib-doc-casp14-assessment-2021","title":"Critical Assessment of Methods of Protein Structure Prediction (CASP) – Round XIV","authors":["Andriy Kryshtafovych","Torsten Schwede","Maya Topf","Krzysztof Fidelis","John Moult"],"publisher":"Proteins: Structure, Function, and Bioinformatics (author manuscript in PubMed Central)","publicationDate":"2021-10-07","version":"Retrieved for the candidate pack on 2026-10-30 (SHA-256 df99b254a35a7840ddee25447610b25ab4a93154355ed2a0ec6db9b25d10710d). NIH author manuscript (PMC8726744) of Proteins 89(12):1607–1617; the publisher version of record was not retrieved.","canonicalUrl":"https://pmc.ncbi.nlm.nih.gov/articles/PMC8726744/","evidenceUrl":"https://pmc.ncbi.nlm.nih.gov/articles/PMC8726744/","language":"en","accessedAt":"2026-10-30","reuse":{"attribution":"Andriy Kryshtafovych, Torsten Schwede, Maya Topf, Krzysztof Fidelis, John Moult, “Critical Assessment of Methods of Protein Structure Prediction (CASP) – Round XIV”, 2021-10-07.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-kp-neural-machine-translation-rare-words-2015-v1","documentId":"kp-neural-machine-translation-rare-words-2015","title":"Neural Machine Translation of Rare Words with Subword Units","authors":["Rico Sennrich","Barry Haddow","Alexandra Birch"],"publisher":"arXiv","publicationDate":"2015-08-31","version":"arXiv:1508.07909v1, submitted 31 August 2015 (UTC). Retrieved for the candidate pack on 2026-10-28 (SHA-256 1c3665998df191f8a63488eff25beb7313ce27137d8f3a153b00ce94a51d0f60). The author list is the byline as printed on the first page.","versionDate":"2015-08-31","canonicalUrl":"https://arxiv.org/abs/1508.07909v1","evidenceUrl":"https://arxiv.org/pdf/1508.07909v1","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"Rico Sennrich, Barry Haddow, Alexandra Birch, “Neural Machine Translation of Rare Words with Subword Units”, 2015-08-31.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-kp-palm-scaling-language-modeling-pathways-2022-v1","documentId":"kp-palm-scaling-language-modeling-pathways-2022","title":"PaLM: Scaling Language Modeling with Pathways","authors":["Aakanksha Chowdhery","Sharan Narang","Jacob Devlin","Maarten Bosma","Gaurav Mishra","Adam Roberts","Paul Barham","Hyung Won Chung","Charles Sutton","Sebastian Gehrmann","Parker Schuh","Kensen Shi","Sasha Tsvyashchenko","Joshua Maynez","Abhishek Rao","Parker Barnes","Yi Tay","Noam Shazeer","Vinodkumar Prabhakaran","Emily Reif","Nan Du","Ben Hutchinson","Reiner Pope","James Bradbury","Jacob Austin","Michael Isard","Guy Gur-Ari","Pengcheng Yin","Toju Duke","Anselm Levskaya","Sanjay Ghemawat","Sunipa Dev","Henryk Michalewski","Xavier Garcia","Vedant Misra","Kevin Robinson","Liam Fedus","Denny Zhou","Daphne Ippolito","David Luan","Hyeontaek Lim","Barret Zoph","Alexander Spiridonov","Ryan Sepassi","David Dohan","Shivani Agrawal","Mark Omernick","Andrew M. Dai","Thanumalayan Sankaranarayana Pillai","Marie Pellat","Aitor Lewkowycz","Erica Moreira","Rewon Child","Oleksandr Polozov","Katherine Lee","Zongwei Zhou","Xuezhi Wang","Brennan Saeta","Mark Diaz","Orhan Firat","Michele Catasta","Jason Wei","Kathy Meier-Hellstern","Douglas Eck","Jeff Dean","Slav Petrov","Noah Fiedel"],"publisher":"arXiv","publicationDate":"2022-04-05","version":"arXiv:2204.02311v1, submitted 5 April 2022 (UTC). Retrieved for the candidate pack on 2026-10-28 (SHA-256 692b101e3d0abf3736fa6721dc03de4fe86eed27f8831705e8aafb81f9aa0a90). The author list is the byline as printed on the first page.","versionDate":"2022-04-05","canonicalUrl":"https://arxiv.org/abs/2204.02311v1","evidenceUrl":"https://arxiv.org/pdf/2204.02311v1","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"Aakanksha Chowdhery and others, “PaLM: Scaling Language Modeling with Pathways”, 2022-04-05.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-kp-distilling-knowledge-neural-network-2015-v1","documentId":"kp-distilling-knowledge-neural-network-2015","title":"Distilling the Knowledge in a Neural Network","authors":["Geoffrey Hinton","Oriol Vinyals","Jeff Dean"],"publisher":"arXiv","publicationDate":"2015-03-09","version":"arXiv:1503.02531v1, submitted 9 March 2015 (UTC). Retrieved for the candidate pack on 2026-10-28 (SHA-256 74e6689115c539db499f9d6153edecb364059926fd45402454f8210442444c5a). The author list is the byline as printed on the first page.","versionDate":"2015-03-09","canonicalUrl":"https://arxiv.org/abs/1503.02531v1","evidenceUrl":"https://arxiv.org/pdf/1503.02531v1","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"Geoffrey Hinton, Oriol Vinyals, Jeff Dean, “Distilling the Knowledge in a Neural Network”, 2015-03-09.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-th-e-mccarthy-bloomfield-review","documentId":"th-mccarthy-review-question-of-ai","title":"Review of The Question of Artificial Intelligence, Brian Bloomfield, ed.","authors":["John McCarthy"],"publisher":"John McCarthy's pages at Stanford (www-formal.stanford.edu)","publicationDate":null,"version":"Retrieved for the candidate pack on 2026-10-29 (SHA-256 b2d0a5f40b99339f4871035960add7ab06f9a7bc2bdd25ce1082897dbf667640). Author's HTML page; the review carries no publication date in the retrieved text, and the page footer is a generation stamp 'Tue Jun 13 03:06:03 PDT 2000'. Where the review was printed was not established from a retrieved source. jmc.stanford.edu refused (connection closed); this is the www-formal host. Its wording can change; earlier wording is not authenticated.","canonicalUrl":"http://www-formal.stanford.edu/jmc/reviews/bloomfield/bloomfield.html","evidenceUrl":"http://www-formal.stanford.edu/jmc/reviews/bloomfield/bloomfield.html","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"John McCarthy, “Review of The Question of Artificial Intelligence, Brian Bloomfield, ed.”.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-th-b-rosenblatt-1958","documentId":"th-rosenblatt-1958","title":"The Perceptron: A Probabilistic Model for Information Storage and Organization in the Brain","authors":["F. Rosenblatt"],"publisher":"Psychological Review (American Psychological Association); course copy hosted at ling.upenn.edu","publicationDate":"1958","version":"Retrieved for the candidate pack on 2026-10-29 (SHA-256 f32fdf8c0657cda33ace13487856dd4facd34c3eeb6a6d3011107339928fbd57). Scan of the journal pages with an OCR text layer (the year prints as \"19S8\" in the text layer); course copy, University of Pennsylvania.","canonicalUrl":"https://www.ling.upenn.edu/courses/cogs501/Rosenblatt1958.pdf","evidenceUrl":"https://www.ling.upenn.edu/courses/cogs501/Rosenblatt1958.pdf","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"F. Rosenblatt, “The Perceptron: A Probabilistic Model for Information Storage and Organization in the Brain”, 1958.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-th-a-sandewall-1969-ijcai","documentId":"th-sandewall-1969-heuristic-search","title":"Concepts and Methods for Heuristic Search","authors":["Erik J Sandewall"],"publisher":"IJCAI (proceedings host)","publicationDate":null,"version":"Retrieved for the candidate pack on 2026-10-29 (SHA-256 75684bb19bf24ddd28827c0eca5d162e67f2969a868156277b97f220e35ba851). Proceedings PDF as hosted by ijcai.org (IJCAI 1969, paper 21, pp. 199–218)","canonicalUrl":"https://ijcai.org/proceedings/1969/0021.pdf","evidenceUrl":"https://ijcai.org/proceedings/1969/0021.pdf","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"Erik J Sandewall, “Concepts and Methods for Heuristic Search”.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-th-c-brants-2007","documentId":"th-brants-2007","title":"Large Language Models in Machine Translation","authors":["Thorsten Brants","Ashok C. Popat","Peng Xu","Franz J. Och","Jeffrey Dean"],"publisher":"Association for Computational Linguistics (ACL Anthology)","publicationDate":"2007-06","version":"Retrieved for the candidate pack on 2026-10-29 (SHA-256 25ca49066ae490a82844a906946651d3043a991245b7062b8ee40cf7d3c9082c). EMNLP-CoNLL 2007 proceedings PDF as hosted by the ACL Anthology (D07-1090)","canonicalUrl":"https://aclanthology.org/D07-1090.pdf","evidenceUrl":"https://aclanthology.org/D07-1090.pdf","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"Thorsten Brants, Ashok C. Popat, Peng Xu, Franz J. Och, Jeffrey Dean, “Large Language Models in Machine Translation”, 2007-06.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"c3-src-stepfun-site-bundle","documentId":"step-5-preview-announcement","title":"阶跃星辰官网（构建文件 index-4zBpLKmx.js）","authors":["StepFun"],"publisher":"StepFun (阶跃星辰), stepfun.com","publicationDate":null,"version":"Undated page, retrieved on 2026-10-29 (SHA-256 4a9822256a9c02a015133c2dbf8edd147c117d9c13e633cdd6c50258ae484ae5) directly from the publisher. Version: index-4zBpLKmx.js. The stepfun.com pages are served as an empty JavaScript shell; their text (newsroom posts with their dates, and the footer) is carried in this content-hashed build file, read as it stood on 29 October 2026. The file name changes with each site build; earlier builds not inspected. Its wording can change; earlier wording is not authenticated. English title (machine translation): “StepFun website build file carrying the newsroom posts and site footer”.","canonicalUrl":"https://www.stepfun.com/assets/index-4zBpLKmx.js","evidenceUrl":"https://www.stepfun.com/assets/index-4zBpLKmx.js","language":"zh-Hans","accessedAt":"2026-10-29","reuse":{"attribution":"StepFun, “阶跃星辰官网（构建文件 index-4zBpLKmx.js）”.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-rd-gans-2023-not-worried","documentId":"gans-2023-not-worried","title":"Why I am not worried about superintelligent machines killing us all","authors":["Joshua Gans"],"publisher":"Author's Substack (joshuagans.substack.com)","publicationDate":"2023-06-23","version":"Retrieved for the candidate pack on 2026-10-29 (SHA-256 7906ffe313a2d7e08cdeb9d175d29462e95eedb348b29517270a24fb38a5fcad). Current Substack post, datePublished 2023-06-23; its opening summaries of the Munk debate speakers are the author's paraphrases of others and are not quoted. The cross-family check retrieved it again on 2026-10-31; the bytes differ, and the check compared the quoted passages.","canonicalUrl":"https://joshuagans.substack.com/p/why-i-am-not-worried-about-superintelligent","evidenceUrl":"https://joshuagans.substack.com/p/why-i-am-not-worried-about-superintelligent","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"Joshua Gans, “Why I am not worried about superintelligent machines killing us all”, 2023-06-23.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-rd-omohundro-2007-nature-self-improving","documentId":"omohundro-2007-nature-self-improving","title":"The Nature of Self-Improving Artificial Intelligence","authors":["Stephen M. Omohundro"],"publisher":"Self-Aware Systems (author's site, selfawaresystems.com)","publicationDate":"2007-09-05","version":"Retrieved for the candidate pack on 2026-10-29 (SHA-256 f16e74e6f8f024d12110ed11d81a717c9de6312945c5074e3cd9bc7d3f31af9b). author's PDF headed 'September 5, 2007, revised January 21, 2008'; the September 2007 version was not located. The cross-family check retrieved it again on 2026-10-31, with the same bytes.","canonicalUrl":"https://selfawaresystems.com/wp-content/uploads/2008/01/nature_of_self_improving_ai.pdf","evidenceUrl":"https://selfawaresystems.com/wp-content/uploads/2008/01/nature_of_self_improving_ai.pdf","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"Stephen M. Omohundro, “The Nature of Self-Improving Artificial Intelligence”, 2007-09-05.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-rd-pace-2019-instrumental-convergence-debate","documentId":"pace-2019-instrumental-convergence-debate","title":"Debate on Instrumental Convergence between LeCun, Russell, Bengio, Zador, and More","authors":["Ben Pace"],"publisher":"LessWrong (post by Ben Pace reproducing a public Facebook thread)","publicationDate":"2019-10-04","version":"Retrieved for the candidate pack on 2026-10-29 (SHA-256 59e3dd77f4825a5a60ce7f1f10dd8c2eebaac7786aee13c861e21d853d251495). Post contents version 1.0.0 (unedited since posting on 2019-10-04), retrieved through the LessWrong GraphQL API (post WxW6Gc6f2z3mzmqKs) because the page refused direct retrieval (HTTP 403). The compiler states that he improved formatting and fixed typos; the Facebook original was not read. The cross-family check retrieved it again on 2026-10-31; the bytes differ, and the check compared the quoted passages.","canonicalUrl":"https://www.lesswrong.com/posts/WxW6Gc6f2z3mzmqKs/debate-on-instrumental-convergence-between-lecun-russell","evidenceUrl":"https://www.lesswrong.com/posts/WxW6Gc6f2z3mzmqKs/debate-on-instrumental-convergence-between-lecun-russell","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"Ben Pace, “Debate on Instrumental Convergence between LeCun, Russell, Bengio, Zador, and More”, 2019-10-04.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}}],"evidence":[{"id":"evidence-abilene-nvidia-gb200-2025","claimId":"abilene-nvidia-gb200-2025","sourceId":"source-oracle-stargate-2025","sourceRole":"primary","support":"supports","locator":"Paragraph beginning “Meanwhile, construction of Stargate I”","passage":"Oracle began delivering the first Nvidia GB200 racks last month","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-15","note":"Re-checked 2026-10-15 (research-debt pass resolving Audit B's RESEARCH MORE). openai.com refused direct retrieval (HTTP 403) and the Wayback Machine did not answer; the quotation was verified verbatim against the current page text obtained through a reader relay (r.jina.ai), not against a dated capture, so it does not authenticate the July 2025 bytes. Company statements are not independent proof of implementation. Human source review pending."},{"id":"evidence-xm-zuckerberg-strategy","claimId":"xm-zuckerberg-strategy","sourceId":"source-xm-open-strategy","sourceRole":"primary","support":"supports","locator":"Byline: By Mark Zuckerberg, Founder and CEO.","passage":"Mark Zuckerberg is credited as the essay’s author.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-09-29","note":"Passage checked by machine against the identified source expression. No human editorial acceptance or independent verification of implementation is implied."},{"id":"evidence-prov-fsf-v2-0-alert-threshold","claimId":"prov-fsf-v2-0-alert-threshold","sourceId":"source-fsf-2-0","sourceRole":"primary","support":"supports","locator":"PDF p. 3 (printed p. 3), Framework, component “2 - Assessing the Capabilities of Frontier Models”, second paragraph, first sentence","passage":"we will define a set of evaluations called “early warning evaluations,” with a specific “alert threshold” that flags when a CCL may be reached before the evaluations are run again.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-03","note":"Verbatim excerpt checked by an automated research assistant on 2026-10-03 against the Internet Archive capture of 2025-02-05 (the edition as first published) and the current file, which carries a later documented correction; the passage is identical in both. Extraction note: Quote starts mid-sentence after “To do so,”; meaning unchanged. Same wording and page in the 2025-02-05 capture and the served copy. Human editorial review is pending."},{"id":"evidence-ts-a1-turing-c1951-context","claimId":"ts-a1-turing-c1951-context","sourceId":"source-turing-c1951-amt-b-4","sourceRole":"primary","support":"supports","locator":"Concluding paragraph, typescript p. 10 (scan 16)","passage":"Once the machine thinking method had started, Turing expects it soon to outstrip human powers; the machines would not die and would converse with each other to sharpen their wits.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-06","note":"Read on the page image."},{"id":"evidence-ts-a1-more-1998-contests","claimId":"ts-a1-more-1998-contests","sourceId":"source-vc-comments-2000-capture","sourceRole":"primary","support":"supports","locator":"Section \"Comment by Max More\" (\"Singularity Meets Economy\"), paragraphs following the opening quotation from Vinge","passage":"Vinge, like I.J. Good, expects an immediate intelligence explosion leading to a total transformation of the world. I have doubts about both of these assumptions. [...] to move from this immediately to drastically superintelligent thinkers seems to me doubtful.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-06","note":"Re-verified in the capture of 2000-08-17 on 2026-10-06."},{"id":"evidence-ts-b2-christiano-2022-contests","claimId":"ts-b2-christiano-2022-contests","sourceId":"source-christiano-2022-where-i-agree-and-disagree","sourceRole":"primary","support":"supports","locator":"Section \"Disagreements\", bullet beginning \"One important factor seems to be\"","passage":"AI systems avoid making major technical contributions, or revealing the extent of their capabilities, because they are lying in wait to cause trouble later. But [...] SGD will be aggressively selecting against any AI systems who don’t do impressive-looking stuff.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-28","note":"Checked against the first stored version on 2026-10-06. On 2026-10-30, by the maintainer’s decision of that day, the quotation was corrected to the archive capture of 2022-06-19 (quotation marks and apostrophes as in the capture), which a cross-family archive check read on 2026-10-28; the proposition is unchanged."},{"id":"evidence-ec-g01-davidson-a","claimId":"ec-g01-davidson-2021-explosive-economic-growth-a","sourceId":"source-davidson-2021-explosive-economic-growth","sourceRole":"primary","support":"supports","locator":"Section \"AI robots as a form of labor\"","passage":"In this (extreme!) fiction, AI robots can perfectly substitute for all human labor.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-25","note":"Quoted by the cross-family check of 2026-10-25 from the recorded capture (20210702003241). Not re-read in the correction pass of 2026-10-25: the publisher returned HTTP 403 and web.archive.org refused connections.","contextOnly":{"reason":"The sentence sets up a hypothetical; shown alone it reads as a claim about actual AI.","requires":"The scenario framing and the paragraph’s conclusion that, in this scenario, growth models make super-exponential growth the default expectation; Davidson’s overall conclusion is probabilistic."}},{"id":"evidence-ec-m01-13","claimId":"ec-m01-krueger-1991-computers-wage-structure-a","sourceId":"source-krueger-1991-computers-wage-structure","sourceRole":"primary","support":"supports","locator":"pdf page 38; Section V, Conclusion (printed p. 24)","passage":"support for the view that technological change -- and in particular the spread of computers at work … has significantly contributed to recent changes in the wage structure.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-14","note":"Candidate pack passage M01-13 (research/economics-mainstream). The quotation (28 words) matched the retrieved current copy (SHA-256 8d9b08fbad59733e3d0674bb8a76cb253e99a8f8d9cda4bedab8b05fdcbd0481) in the pack's verification. Re-checked at admission on 2026-10-14 against a copy retrieved that day."},{"id":"evidence-ec-m01-22","claimId":"ec-m01-acemoglu-restrepo-2019-automation-and-new-tasks-b","sourceId":"source-acemoglu-restrepo-2019-automation-and-new-tasks","sourceRole":"primary","support":"supports","locator":"pdf page 6; Conceptual Framework (printed p. 5)","passage":"In contrast, the canonical approach in economics bypasses tasks and directly posits a production function of the form Y = F (AK K, AL L)","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-14","note":"Candidate pack passage M01-22 (research/economics-mainstream). The quotation (25 words) matched the retrieved current copy (SHA-256 7757f77583c186dbbd0945e81e286fbb3ec35ed4e633ce65b2bb22f9f1bec490) in the pack's verification. Re-checked at admission on 2026-10-14 against a copy retrieved that day.","contextOnly":{"reason":"Retrospective characterisation (2019) of how economics modelled technology; cannot meet a pre-2015 text-level criterion.","requires":"Pre-2015 tier-1 texts using factor-augmenting or skill-biased frameworks for computers."}},{"id":"evidence-ec-m04-02","claimId":"ec-m04-agrawal-gans-goldfarb-2018-prediction-judgment-complexity-a","sourceId":"source-agrawal-gans-goldfarb-2018-prediction-judgment-complexity","sourceRole":"primary","support":"supports","locator":"pdf page 2; abstract","passage":"We interpret recent developments in the field of artificial intelligence (AI) as improvements in prediction technology.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-14","note":"Candidate pack passage M04-02 (research/economics-mainstream). The quotation (16 words) matched the retrieved current copy (SHA-256 64e4872abaea128fc37382d098bc0d4a5662fbdad641e38e010210169158a5ad) in the pack's verification. Re-checked at admission on 2026-10-14 against a copy retrieved that day."},{"id":"evidence-ec-m04-03","claimId":"ec-m04-agrawal-gans-goldfarb-2018-prediction-judgment-complexity-a","sourceId":"source-agrawal-gans-goldfarb-2018-prediction-judgment-complexity","sourceRole":"primary","support":"supports","locator":"pdf page 5; section 1 Introduction","passage":"We proceed by first providing supportive evidence for our assumption that recent developments in AI overwhelmingly impact the costs of prediction.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-14","note":"Candidate pack passage M04-03 (research/economics-mainstream). The quotation (21 words) matched the retrieved current copy (SHA-256 64e4872abaea128fc37382d098bc0d4a5662fbdad641e38e010210169158a5ad) in the pack's verification. Re-checked at admission on 2026-10-14 against a copy retrieved that day."},{"id":"evidence-ec-m04-04","claimId":"ec-m04-agrawal-gans-goldfarb-2018-prediction-judgment-complexity-a","sourceId":"source-agrawal-gans-goldfarb-2018-prediction-judgment-complexity","sourceRole":"primary","support":"supports","locator":"pdf page 25; section 6 Conclusions","passage":"We show that prediction and judgment are generally complements, as long as judgment isn't too difficult.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-14","note":"Candidate pack passage M04-04 (research/economics-mainstream). The quotation (16 words) matched the retrieved current copy (SHA-256 64e4872abaea128fc37382d098bc0d4a5662fbdad641e38e010210169158a5ad) in the pack's verification. Re-checked at admission on 2026-10-14 against a copy retrieved that day."},{"id":"evidence-ec-m06a-10","claimId":"ec-m06a-acemoglu-restrepo-2016-race-between-machine-and-man-a","sourceId":"source-acemoglu-restrepo-2016-race-between-machine-and-man","sourceRole":"primary","support":"supports","locator":"pdf page 2; abstract","passage":"In a static version where capital is fixed and technology is exogenous, automation reduces employment and the labor share, and may even reduce wages","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-14","note":"Candidate pack passage M06a-10 (research/economics-mainstream). The quotation (24 words) matched the retrieved current copy (SHA-256 441d01202afd56ef8002fc24ffc2beb51191741c0b5accb11d2534620dd616b7) in the pack's verification. Re-checked at admission on 2026-10-14 against a copy retrieved that day.","contextOnly":{"reason":"Fresh-context audit (A2) judged that the quotation misleads when shown alone.","requires":"Static version only; 'while the creation of new tasks has the opposite effects' follows directly."}},{"id":"evidence-ec-m06b-07","claimId":"ec-m06b-nilsson-1984-ai-employment-and-income-a","sourceId":"source-nilsson-1984-ai-employment-and-income","sourceRole":"primary","support":"supports","locator":"pdf page 6; Allaying the Economic Fear (printed p. 10)","passage":"Separating income from employment would seem a better way to solve the economic problem of unemployment.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-14","note":"Candidate pack passage M06b-07 (research/economics-mainstream). The quotation (16 words) matched the retrieved current copy (SHA-256 4dc8b541e4bd22bbc54c146a7e8c748f9f16a835d1b256e026f521c4462d3418) in the pack's verification. Re-checked at admission on 2026-10-14 against a copy retrieved that day."},{"id":"evidence-ec-e01-15","claimId":"ec-e01-nordhaus-2015-economic-singularity-b","sourceId":"source-nordhaus-2015-nber","sourceRole":"primary","support":"supports","locator":"NBER WP 21547, sec. IX \"Summary of Tests for Singularity\", p. 28","passage":"I define Singularity as a time when the economic growth rate crosses 20% per year. … the time at which the economy might plausibly cross the Singularity is 100 years or more.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-16","note":"Candidate pack passage E01-15 (research/economics-mainstream/esoteric). The quotation (32 words) matched the retrieved current copy (SHA-256 cb481e5e99ef9bad8575d9150bcc8464eda4904722cc5048389ab6159858b062) in the pack's verification of 2026-10-15. Re-checked at admission on 2026-10-16 against a copy retrieved that day.","contextOnly":{"reason":"Fresh-context audit (A1) judged that the quotation misleads when shown alone.","requires":"The ellipsis removes 'Using simple extrapolation for the two positive tests,'. Before that: 'Five of the seven tests are negative for Singularity while two are positive.' The '100 years or more' applies only to the two positive tests. That makes it a conditional extrapolation, not a forecast."}},{"id":"evidence-ec-e03-14","claimId":"ec-e03-gans-2023-socially-minded-governance-agi-b","sourceId":"source-gans-2023-socially-minded-governance-agi","sourceRole":"primary","support":"supports","locator":"pdf p.3; §1 Introduction, first paragraph","passage":"These concerns had been outlined by Bostrom (2014), although they are controversial and subject to debate over whether such risks are salient (Gans, 2018) or a reason to slow AGI development (Jones, 2023).","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-16","note":"Candidate pack passage E03-14 (research/economics-mainstream/esoteric). The quotation (33 words) matched the retrieved current copy (SHA-256 3925302d6dd99aefc50cf3c959abd81aebbd5086d7f7364b8ded6bd364c6e8e4) in the pack's verification of 2026-10-15. Re-checked at admission on 2026-10-16 against a copy retrieved that day.","contextOnly":{"reason":"GPT cross-family check 2026-10-14, accepted 2026-10-15","requires":"\"These concerns\" are the existential risks of AGI named in the preceding sentence; the cited disagreement (Gans 2018, Jones 2023) is reported, not the author's refutation."}},{"id":"lg-ev-mx-kosic-xai-team-2023","claimId":"lg-mx-kosic-xai-team-2023","sourceId":"source-xai-team-2023","sourceRole":"secondary","support":"supports","locator":"Paragraph beginning 'That list includes', second sentence","passage":"Ars Technica lists Kyle Kosic among the team named on xAI's website.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The paraphrase’s verbatim anchor “Kyle Kosic” matched the retrieved text on 2026-10-15 and again in a fresh retrieval the same day. Read directly from the publisher. Matching ignored differences of whitespace, case, quotation marks, apostrophes, dashes and Unicode compatibility forms, so the source’s typography can differ. The paraphrase is Selekoa’s; only the anchor is the source’s wording. A cross-family machine check (2026-10-16/17) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"lg-ev-new-shashua-ai21-departure-2026","claimId":"lg-new-shashua-ai21-departure-2026","sourceId":"lg-src-new-calcalist-shashua","sourceRole":"secondary","support":"supports","locator":"Paragraph 1","passage":"intention to step down from both the company and its board of directors","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The quotation (13 words) matched the retrieved text on 2026-10-15 and again in a fresh retrieval the same day. Read directly from the publisher. Matching ignored differences of whitespace, case, quotation marks, apostrophes, dashes and Unicode compatibility forms, so the source’s typography can differ. A cross-family machine check (2026-10-16/17) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"lg-ev-new-shashua-ai21-departure-2026-cofounder","claimId":"lg-new-shashua-ai21-departure-2026","sourceId":"lg-src-new-calcalist-shashua","sourceRole":"secondary","support":"context","locator":"Paragraph 3","passage":"AI21 Labs was founded in 2017 by Prof. Yoav Shoham, Ori Goshen, and Prof. Amnon Shashua.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The quotation (16 words) matched the retrieved text on 2026-10-15 and again in a fresh retrieval the same day. Read directly from the publisher. Matching ignored differences of whitespace, case, quotation marks, apostrophes, dashes and Unicode compatibility forms, so the source’s typography can differ. A cross-family machine check (2026-10-16/17) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"lg-ev-oai-brockman-cofounded-openai","claimId":"lg-oai-brockman-cofounded-openai","sourceId":"lg-src-oai-brockman-x-2024","sourceRole":"primary","support":"supports","locator":"Post text, second sentence","passage":"Brockman’s post refers to his co-founding OpenAI nine years earlier.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The paraphrase’s verbatim anchor “since co-founding OpenAI” matched the retrieved text on 2026-10-15 and again in a fresh retrieval the same day. Read through X’s own syndication endpoint for the post’s text, which truncates long notes. Matching ignored differences of whitespace, case, quotation marks, apostrophes, dashes and Unicode compatibility forms, so the source’s typography can differ. The paraphrase is Selekoa’s; only the anchor is the source’s wording. A cross-family machine check (2026-10-16/17) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"x_syndication"},{"id":"ev-cmp-rsp-v3-3-d6-discretion-1","claimId":"cmp-rsp-v3-3-d6-discretion","sourceId":"source-rsp-3-3","sourceRole":"primary","support":"supports","locator":"PDF p. 3, Introduction, paragraph on Frontier Safety Roadmaps, final sentence","passage":"These are not hard commitments but rather public goals","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Verbatim excerpt checked by an automated research assistant on 2026-10-27 against the publisher copy, whose SHA-256 matches the copy retrieved on 2026-10-15. Refers only to the goals in the Frontier Safety Roadmap, not to the policy as a whole. Human editorial review is pending."},{"id":"ev-cmp-rsp-v3-3-d6-discretion-2","claimId":"cmp-rsp-v3-3-d6-discretion","sourceId":"source-rsp-3-3","sourceRole":"primary","support":"supports","locator":"PDF p. 16 (printed p. 15), §4 Governance, item 1 ('Responsible Scaling Officer'), duty (6)","passage":"making judgment calls on policy interpretation and application","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Verbatim excerpt checked by an automated research assistant on 2026-10-27 against the publisher copy, whose SHA-256 matches the copy retrieved on 2026-10-15. Human editorial review is pending."},{"id":"ev-cmp-ms-fgf-2026-d6-competitor-1","claimId":"cmp-ms-fgf-2026-d6-competitor","sourceId":"source-ms-fgf-2026","sourceRole":"primary","support":"supports","locator":"PDF p. 7 (printed p. 6), §3, Deeper capability assessment, 'Holistic risk assessment' bullet, final sentence","passage":"considers the marginal capability uplift … including currently available open-weights models.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Verbatim excerpt checked by an automated research assistant on 2026-10-27 against the publisher copy, whose SHA-256 matches the copy retrieved on 2026-10-15. In this edition the holistic risk assessment, of which this is part, 'may also inform' the determination of a model's risk level; the February 2025 edition says such results 'then inform' it. Human editorial review is pending."},{"id":"evidence-ap-robin-hanson-hanson-2000-long-term-growth-exponential-modes","claimId":"ap-robin-hanson-hanson-2000-long-term-growth-exponential-modes","sourceId":"source-hanson-2000-long-term-growth-exponential-modes","sourceRole":"primary","support":"supports","locator":"PDF text layer, first two pages: author name on the title page or first page","passage":"Robin Hanson","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Credited name checked by an automated research assistant on 2026-10-27 in a direct retrieval. Human editorial review is pending.","retrievalRoute":"direct"},{"id":"evidence-ap-eliezer-yudkowsky-extropians-1997-09-24-yudkowsky","claimId":"ap-eliezer-yudkowsky-extropians-1997-09-24-yudkowsky","sourceId":"source-extropians-1997-09-24-yudkowsky","sourceRole":"primary","support":"supports","locator":"Message header, sender name (address not reproduced)","passage":"Eliezer S. Yudkowsky","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Credited name checked by an automated research assistant on 2026-10-27 in a direct retrieval. Human editorial review is pending.","retrievalRoute":"direct"},{"id":"evidence-ap-eliezer-yudkowsky-lw-2023-gpts-are-predictors-not-imitators","claimId":"ap-eliezer-yudkowsky-lw-2023-gpts-are-predictors-not-imitators","sourceId":"source-lw-2023-gpts-are-predictors-not-imitators","sourceRole":"primary","support":"supports","locator":"Post author list in the publisher’s post data (LessWrong GraphQL API)","passage":"Credited as “Eliezer Yudkowsky” (post author list in the publisher’s post data (LessWrong GraphQL API)).","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-27","note":"Credited name checked by an automated research assistant on 2026-10-27 in a direct retrieval through the publisher’s post data. Given as a labelled paraphrase because a quotation would exceed the short-quotation limit for this document. Human editorial review is pending.","retrievalRoute":"direct"},{"id":"ev-cmp-rsp-v2-1-d2-levels-1","claimId":"cmp-rsp-v2-1-d2-levels","sourceId":"source-rsp-2-1","sourceRole":"primary","support":"supports","locator":"PDF p. 8 (printed p. 4), §2 Capability Thresholds and Required Safeguards, table row 'Chemical, Biological, Radiological, and Nuclear (CBRN) weapons', entry 'CBRN-3', Capability Thresholds column","passage":"The edition’s CBRN-3 Capability Threshold is the ability to significantly help people with basic technical backgrounds create or obtain and deploy CBRN weapons.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-27","note":"Explicit paraphrase, written on 2026-10-27 by an automated research assistant after re-reading the passage in the publisher copy, whose SHA-256 matches the copy retrieved on 2026-10-15. The comparison quoted the passage; it is given here as a paraphrase to keep the edition within the quotation limit. One of four labelled Capability Thresholds (CBRN-3, CBRN-4, AI R&D-4, AI R&D-5; table PDF p. 8). Human editorial review is pending."},{"id":"ev-cmp-rsp-v2-1-d2-levels-2","claimId":"cmp-rsp-v2-1-d2-levels","sourceId":"source-rsp-2-1","sourceRole":"primary","support":"supports","locator":"PDF p. 20 (printed p. 16), Appendix C Detailed Capability Thresholds, 'Autonomous AI Research and Development', entry 'AI R&D-4' (first sentence) and entry 'AI R&D-5' (first and second sentences)","passage":"The edition defines AI R&D-4 as fully automating an entry-level, remote-only Anthropic researcher’s work, and AI R&D-5 as dramatically accelerating effective scaling: an observed or projected one-year rise in effective training compute, for the most capable model in the world, equal to two years of average progress, early 2018–early 2024.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-28","note":"Explicit paraphrase by an automated research assistant, corrected on 2026-10-28 after a blind check of all 287 comparison paraphrases by a reviewer from a different model family on 2026-10-28 (research/frontier-framework-comparison/codex-paraphrases-2026-10-28.md), which found that it left out the second sentence of AI R&D-5, which defines dramatic acceleration as a one-year rise in effective training compute equal to two years of the average rate of early 2018 to early 2024. The correction was written from the passage as re-read in the publisher copy retrieved on 2026-10-28, whose SHA-256 matches the copy retrieved on 2026-10-15. Given as a paraphrase to keep the edition within the quotation limit. CBRN-4 (substantial uplift to moderately resourced state programs) is the fourth labelled threshold. A Model Autonomy checkpoint sits below the AI R&D thresholds (PDF pp. 8–9). Human editorial review is pending."},{"id":"ev-cmp-fsf-2024-d8-process-1","claimId":"cmp-fsf-2024-d8-process","sourceId":"source-fsf-1-0","sourceRole":"primary","support":"supports","locator":"PDF p. 1 (printed p. 1), opening section, third paragraph, third sentence","passage":"The edition says the Framework will be reviewed periodically and that Google DeepMind expects it to change substantially as understanding of frontier-model risks and benefits improves.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-27","note":"Explicit paraphrase, written on 2026-10-27 by an automated research assistant after re-reading the passage in the publisher copy, whose SHA-256 matches the copy retrieved on 2026-10-15. The comparison quoted the passage; it is given here as a paraphrase to keep the edition within the quotation limit. Human editorial review is pending."},{"id":"ev-cmp-fsf-2024-d8-process-2","claimId":"cmp-fsf-2024-d8-process","sourceId":"source-fsf-1-0","sourceRole":"primary","support":"supports","locator":"PDF p. 6 (printed p. 6), Future work, second paragraph, second sentence","passage":"Under Future work, the edition says substantive revisions will be published as appropriate.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-27","note":"Explicit paraphrase, written on 2026-10-27 by an automated research assistant after re-reading the passage in the publisher copy, whose SHA-256 matches the copy retrieved on 2026-10-15. The comparison quoted the passage; it is given here as a paraphrase to keep the edition within the quotation limit. Human editorial review is pending."},{"id":"ev-cmp-faif-2026-d1-cyber-1","claimId":"cmp-faif-2026-d1-cyber","sourceId":"source-faif-2026","sourceRole":"primary","support":"supports","locator":"PDF p. 2, §2.1 Risk Identification, third paragraph, first sentence","passage":"The edition names four primary risk domains, those it considers most likely to lead to significant or severe outcomes in present and future systems: “CBRN Risks”, “Offensive Cybersecurity Risks”, “Loss of Control Risks” and “Harmful Manipulation Risks”.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-15","note":"Explicit paraphrase, written on 2026-10-27 by an automated research assistant from the comparison’s quotation of this passage, which was checked on 2026-10-15 against the publisher copy (SHA-256 recorded in the comparison pack). The edition could not be retrieved again on 2026-10-27; the archive capture of 2026-07-16 has the same SHA-256 (research/archive-checks-2026-10-26/codex-report.md). Given as a paraphrase to keep the edition within the quotation limit. Human editorial review is pending."},{"id":"ev-cmp-faif-2026-d1-cyber-2","claimId":"cmp-faif-2026-d1-cyber","sourceId":"source-faif-2026","sourceRole":"primary","support":"supports","locator":"PDF p. 4, §2.1(c) 'Addressing Risks of Malicious Offensive Cybersecurity Usage', second paragraph, first sentence","passage":"The edition says xAI treats malicious cyber offence accelerated by AI as a core risk domain.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-15","note":"Explicit paraphrase, written on 2026-10-27 by an automated research assistant from the comparison’s quotation of this passage, which was checked on 2026-10-15 against the publisher copy (SHA-256 recorded in the comparison pack). The edition could not be retrieved again on 2026-10-27; the archive capture of 2026-07-16 has the same SHA-256 (research/archive-checks-2026-10-26/codex-report.md). Given as a paraphrase to keep the edition within the quotation limit. Human editorial review is pending."},{"id":"ev-cmp-meta-faf-v1-1-d6-discretion-1","claimId":"cmp-meta-faf-v1-1-d6-discretion","sourceId":"source-meta-faf-v1-1","sourceRole":"primary","support":"supports","locator":"PDF p. 13 (printed p. 13), §3.3 Risk thresholds, Table 1: Risk thresholds for frontier AI, Critical row, Measures column, security mitigations (qualifying clause)","passage":"insofar as is technically feasible and commercially practicable","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Verbatim excerpt as quoted and located by a reviewer from a different model family on 2026-10-27 in the Internet Archive capture of 2025-02-13, which it retrieved and hashed (decoded PDF SHA-256 9fa301df…cc21; research/frontier-framework-comparison/codex-meta-v1-1-2026-10-27.md). Human editorial review is pending."},{"id":"evidence-fl-link-ms-fgf-2026-eu-ai-act-1","claimId":"fl-link-ms-fgf-2026-eu-ai-act","sourceId":"source-ms-fgf-2026","sourceRole":"primary","support":"supports","locator":"Section 3 “Evaluation and assessment”, “Monitoring for leading indicators of tracked high-risk capabilities”, PDF p. 6 (printed p. 5)","passage":"A leading indicator assessment is run on any model that is in scope for frontier model requirements under applicable laws, such as the EU AI Act","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-28","note":"Candidate pack passage, frameworks to law (research/frameworks-to-law). The quotation (26 words) matched the text retrieved for the candidate pack on 2026-10-27 and again at admission on 2026-10-28, in a fresh retrieval whose SHA-256 equals the pack’s. Read directly from cdn-dynmedia-1.microsoft.com. Matching ignored differences of whitespace, case, quotation marks, dashes and Unicode compatibility forms, so the source’s typography can differ. Part of the passage already quoted for the edition's link to SB 53. A cross-family machine check (2026-10-28, item 113) re-read the record’s sources and found full support. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-aib-mod-casp14-other-groups-1","claimId":"aib-mod-casp14-other-groups","sourceId":"source-aib-casp14-assessment","sourceRole":"primary","support":"supports","locator":"section on three-dimensional protein structure modeling","passage":"Although this outstanding performance is dominated by AlphaFold2 (group 427), the dashed black line in Figure 1 shows that other groups also advanced substantially from CASP13.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, AI in biology (research/ai-in-biology). The quotation (26 words) matched the text retrieved for the candidate pack on 2026-10-30. Matching ignored differences of whitespace, case, quotation marks, dashes and Unicode compatibility forms, so the source’s typography can differ. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-aib-mod-casp14-other-groups-2","claimId":"aib-mod-casp14-other-groups","sourceId":"source-aib-casp14-assessment","sourceRole":"primary","support":"supports","locator":"same section","passage":"AlphaFold2 did not submit server models.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, AI in biology (research/ai-in-biology). The quotation (6 words) matched the text retrieved for the candidate pack on 2026-10-30. Matching ignored differences of whitespace, case, quotation marks, dashes and Unicode compatibility forms, so the source’s typography can differ. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-aib-ppl-kohli-alphafold-paper-1","claimId":"aib-ppl-kohli-alphafold-paper","sourceId":"source-atlas-alphafold-paper","sourceRole":"primary","support":"supports","locator":"Author information: Authors and Affiliations","passage":"Andrew W. Senior, Koray Kavukcuoglu, Pushmeet Kohli & Demis Hassabis","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, AI in biology (research/ai-in-biology). The quotation (9 words) matched the text retrieved for the candidate pack on 2026-10-30. Matching ignored differences of whitespace, case, quotation marks, dashes and Unicode compatibility forms, so the source’s typography can differ. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-kp-states-neural-machine-translation-rare-words-2015-1-1","claimId":"kp-states-neural-machine-translation-rare-words-2015-1","sourceId":"source-kp-neural-machine-translation-rare-words-2015-v1","sourceRole":"primary","support":"supports","locator":"arXiv v1, PDF p. 1, abstract","passage":"In this paper, we introduce a simpler and more effective approach, enabling the translation of rare and unknown words by encoding them as sequences of subword units…","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, key papers (research/key-papers). The quotation (27 words) matched the text retrieved for the candidate pack on 2026-10-28 (research/key-papers/verification.json). Matching ignored differences of whitespace, case, quotation marks, dashes and line-break hyphens, so the source’s typography can differ. No human editorial review."},{"id":"evidence-kp-cites-ernie-3-titan-report-language-models-few-shot-learners-2020-1","claimId":"kp-cites-ernie-3-titan-report-language-models-few-shot-learners-2020","sourceId":"c2-src-ernie3-titan-arxiv-v1","sourceRole":"primary","support":"supports","locator":"PDF p. 23, reference or mention by title","passage":"The text names the work by its title.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, key papers (research/key-papers). The citation was matched (title) in the text retrieved for the candidate pack on 2026-10-28 and re-found by its mechanical check. The paraphrase is Selekoa’s. A cross-family machine check (2026-10-30, item B062) found the citation in the citing text. No human editorial review."},{"id":"evidence-kp-cites-qwen-report-improving-language-understanding-by-generative-2018-1","claimId":"kp-cites-qwen-report-improving-language-understanding-by-generative-2018","sourceId":"source-cn-qwen","sourceRole":"primary","support":"supports","locator":"reference or mention by title","passage":"The text names the work by its title.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, key papers (research/key-papers). The citation was matched (title) in the text retrieved for the candidate pack on 2026-10-28 and re-found by its mechanical check. The paraphrase is Selekoa’s. No human editorial review."},{"id":"evidence-kp-cites-acemoglu-2024-simple-macroeconomics-of-ai-nordhaus-2015-economic-singularity-1","claimId":"kp-cites-acemoglu-2024-simple-macroeconomics-of-ai-nordhaus-2015-economic-singularity","sourceId":"source-acemoglu-2024-nber","sourceRole":"primary","support":"supports","locator":"PDF p. 51, reference or mention by title","passage":"The text names the work by its title.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, key papers (research/key-papers). The citation was matched (title) in the text retrieved for the candidate pack on 2026-10-28 and re-found by its mechanical check. The paraphrase is Selekoa’s. No human editorial review."},{"id":"evidence-kp-authored-jacob-devlin-palm-scaling-language-modeling-pathways-2022-1","claimId":"kp-authored-jacob-devlin-palm-scaling-language-modeling-pathways-2022","sourceId":"source-kp-palm-scaling-language-modeling-pathways-2022-v1","sourceRole":"primary","support":"supports","locator":"PDF p. 1, byline","passage":"Jacob Devlin","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, key papers (research/key-papers). The printed name (2 words) was found in the byline of the text retrieved for the candidate pack on 2026-10-28. No human editorial review."},{"id":"evidence-kp-authored-oriol-vinyals-distilling-knowledge-neural-network-2015-1","claimId":"kp-authored-oriol-vinyals-distilling-knowledge-neural-network-2015","sourceId":"source-kp-distilling-knowledge-neural-network-2015-v1","sourceRole":"primary","support":"supports","locator":"PDF p. 1, byline","passage":"Oriol Vinyals","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, key papers (research/key-papers). The printed name (2 words) was found in the byline of the text retrieved for the candidate pack on 2026-10-28. No human editorial review."},{"id":"evidence-th-authored-mccarthy-review-1","claimId":"th-authored-mccarthy-review","sourceId":"source-th-e-mccarthy-bloomfield-review","sourceRole":"primary","support":"supports","locator":"Signature block at the foot of the page","passage":"The page ends with the signature block 'John McCarthy, Computer Science Department, Stanford University'.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, Kinds of AI and technical history (research/technical-history). The paraphrase is Selekoa’s, written from the text retrieved for the candidate pack on 2026-10-29; it is not a quotation and was not machine-matched. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-th-cn-name-rosenblatt-1958-connectionist-1","claimId":"th-cn-name-rosenblatt-1958-connectionist","sourceId":"source-th-b-rosenblatt-1958","sourceRole":"primary","support":"supports","locator":"PDF p. 2 (printed pp. 386-387)","passage":"The theory to be presented here takes the empiricist, or \"connectionist\" … The theory has been developed for a hypothetical nervous system, or machine, called a perceptron.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, Kinds of AI and technical history (research/technical-history). The quotation (26 words) matched the text retrieved for the candidate pack on 2026-10-29. Matching ignored differences of whitespace, case, quotation marks, dashes, PDF line-break hyphens and Unicode compatibility forms, so the source’s typography can differ. The omitted words are \"position with regard to these questions\", broken by the page number 387 in the text layer. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-th-sp-def-sandewall-1969-1","claimId":"th-sp-def-sandewall-1969","sourceId":"source-th-a-sandewall-1969-ijcai","sourceRole":"primary","support":"supports","locator":"PDF p. 1, section 1, Introduction","passage":"Following Feigenbaum and Feldman (1963), we define a heuristic method as a device which drastically limits search for solutions in large problem spaces.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, Kinds of AI and technical history (research/technical-history). The quotation (23 words) matched the text retrieved for the candidate pack on 2026-10-29. Matching ignored differences of whitespace, case, quotation marks, dashes, PDF line-break hyphens and Unicode compatibility forms, so the source’s typography can differ. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-th-term-llm-brants-2007-1","claimId":"th-term-llm-brants-2007","sourceId":"source-th-c-brants-2007","sourceRole":"primary","support":"supports","locator":"PDF p. 1, title","passage":"Large Language Models in Machine Translation","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, Kinds of AI and technical history (research/technical-history). The quotation (6 words) matched the text retrieved for the candidate pack on 2026-10-29. Matching ignored differences of whitespace, case, quotation marks, dashes, PDF line-break hyphens and Unicode compatibility forms, so the source’s typography can differ. A cross-family machine check (31 October 2026, item 103) re-read the record’s sources and found that they support what the record states. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-th-term-llm-brants-2007-2","claimId":"th-term-llm-brants-2007","sourceId":"source-th-c-brants-2007","sourceRole":"primary","support":"supports","locator":"PDF p. 1, introduction","passage":"We focus on n-gram language models, which are trained on unlabeled monolingual text.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, Kinds of AI and technical history (research/technical-history). The quotation (13 words) matched the text retrieved for the candidate pack on 2026-10-29. Matching ignored differences of whitespace, case, quotation marks, dashes, PDF line-break hyphens and Unicode compatibility forms, so the source’s typography can differ. A cross-family machine check (31 October 2026, item 103) re-read the record’s sources and found that they support what the record states. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-th-term-llm-brants-2007-3","claimId":"th-term-llm-brants-2007","sourceId":"source-th-c-brants-2007","sourceRole":"primary","support":"supports","locator":"PDF p. 9, conclusion","passage":"This finding underscores the value of being able to train and apply very large language models","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, Kinds of AI and technical history (research/technical-history). The quotation (16 words) matched the text retrieved for the candidate pack on 2026-10-29. Matching ignored differences of whitespace, case, quotation marks, dashes, PDF line-break hyphens and Unicode compatibility forms, so the source’s typography can differ. A cross-family machine check (31 October 2026, item 103) re-read the record’s sources and found that they support what the record states. No human editorial review.","retrievalRoute":"direct"},{"id":"c3-ev-stepfun-step5-announcement","claimId":"c3-stepfun-step5-announcement","sourceId":"c3-src-stepfun-site-bundle","sourceRole":"primary","support":"supports","locator":"Newsroom post dated 2026-09-20, title","passage":"阶跃发布旗舰模型 Step 5 Preview","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, Chinese frontier-AI institutions, third collection (research/china-labs-3). The quotation (11 words, each CJK character counted as one) matched the text retrieved for the candidate pack on 2026-10-29 and again in a fresh retrieval the same day, read directly from the publisher. Matching ignored differences of whitespace, case, quotation marks, dashes and Unicode compatibility forms, so the source’s typography can differ. English machine translation, not verified by a person: “StepFun releases flagship model Step 5 Preview”. A cross-family machine check (2026-10-31, item K117) answered the record’s question blind from fresh retrievals and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"c3-ev-stepfun-step5-announcement-2","claimId":"c3-stepfun-step5-announcement","sourceId":"c3-src-stepfun-site-bundle","sourceRole":"primary","support":"supports","locator":"Newsroom post dated 2026-09-20, closing paragraph","passage":"Step 5 Preview 依旧是一款…我们将在10 月 15 日释放模型权重","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, Chinese frontier-AI institutions, third collection (research/china-labs-3). The quotation (22 words, each CJK character counted as one) matched the text retrieved for the candidate pack on 2026-10-29 and again in a fresh retrieval the same day, read directly from the publisher. Matching ignored differences of whitespace, case, quotation marks, dashes and Unicode compatibility forms, so the source’s typography can differ. Elided quotation: the ellipses mark omitted words, so the passage is not continuous in the source. English machine translation, not verified by a person: “Step 5 Preview is still an [open-source model] … we will release the model weights on 15 October”. A cross-family machine check (2026-10-31, item K117) answered the record’s question blind from fresh retrievals and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-rd-r02-omohundro-2007-nature-self-improving-1","claimId":"rd-r02-omohundro-2007-nature-self-improving","sourceId":"source-rd-omohundro-2007-nature-self-improving","sourceRole":"primary","support":"supports","locator":"Section 2.5, Instrumental goals, PDF p. 13","passage":"The “drives” of self-improving systems that we discuss in the rest of the paper are all instrumental goals that arise from a wide variety of different fundamental goals.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, arguments about catastrophic risk from advanced AI (research/risk-debate). The quotation (28 words) matched the text retrieved for the candidate pack on 2026-10-29. Matching ignored differences of whitespace, case, quotation marks, dashes and Unicode compatibility forms, so the source’s typography can differ. A cross-family machine check (2026-10-31, item 20) answered the record’s question blind and agreed with its stance. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-rd-r02-omohundro-2007-nature-self-improving-2","claimId":"rd-r02-omohundro-2007-nature-self-improving","sourceId":"source-rd-omohundro-2007-nature-self-improving","sourceRole":"primary","support":"supports","locator":"Section 5, The Self-Preservation Drive, PDF p. 25","passage":"This is because, for a wide range of goals, death corresponds to the cessation of all goal achievement","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, arguments about catastrophic risk from advanced AI (research/risk-debate). The quotation (18 words) matched the text retrieved for the candidate pack on 2026-10-29. Matching ignored differences of whitespace, case, quotation marks, dashes and Unicode compatibility forms, so the source’s typography can differ. A cross-family machine check (2026-10-31, item 20) answered the record’s question blind and agreed with its stance. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-rd-r08-gans-2023-not-worried-1","claimId":"rd-r08-gans-2023-not-worried","sourceId":"source-rd-gans-2023-not-worried","sourceRole":"primary","support":"supports","locator":"First reason","passage":"Killing us won’t necessarily be very easy. So there had better be a good reason to do it.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, arguments about catastrophic risk from advanced AI (research/risk-debate). The quotation (18 words) matched the text retrieved for the candidate pack on 2026-10-29. Matching ignored differences of whitespace, case, quotation marks, dashes and Unicode compatibility forms, so the source’s typography can differ. A cross-family machine check (2026-10-31, item 76) re-read the record’s source and found the quotation and stance supported. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-rd-r08-gans-2023-not-worried-2","claimId":"rd-r08-gans-2023-not-worried","sourceId":"source-rd-gans-2023-not-worried","sourceRole":"primary","support":"supports","locator":"Second reason","passage":"the idea that we could immediately be overrun and there is very quick movement up the IQ chart for these machines doesn’t seem plausible.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, arguments about catastrophic risk from advanced AI (research/risk-debate). The quotation (24 words) matched the text retrieved for the candidate pack on 2026-10-29. Matching ignored differences of whitespace, case, quotation marks, dashes and Unicode compatibility forms, so the source’s typography can differ. A cross-family machine check (2026-10-31, item 76) re-read the record’s source and found the quotation and stance supported. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-rd-r10b-bengio-2019-instrumental-convergence-thread-1","claimId":"rd-r10b-bengio-2019-instrumental-convergence-thread","sourceId":"source-rd-pace-2019-instrumental-convergence-debate","sourceRole":"primary","support":"supports","locator":"Comment Thread #2, Yoshua Bengio (reply to Yann LeCun)","passage":"there could be AI systems which surpass human intellectual power in ways that could foil our attempts at setting objective functions which avoid harm to us.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, arguments about catastrophic risk from advanced AI (research/risk-debate). The quotation (26 words) matched the text retrieved for the candidate pack on 2026-10-29. Matching ignored differences of whitespace, case, quotation marks, dashes and Unicode compatibility forms, so the source’s typography can differ. No human editorial review.","retrievalRoute":"direct"}],"at":{"entities":[0,3,7,19,21,22,27,42,43,44,45,46,47,48,49,50,51,52,56,57,62,67,134,162,167,183,199,200,201,202,259,298,307,334,343,435,491,504,513,516,518,519,525,526,531,534,535,538,542,549,565,585,587,605,616,627,723,761,803,884,897,948,1337,1396,1446,1452,1475,1497,1524,1541,1566,1595,1641,1645,1655,1664,1667,1767,1791,1812,1826,1852,1865,1892],"claims":[115,347,434,775,905,973,1246,1305,1314,1349,1398,1422,1491,1526,1657,1877,2036,2089,2168,2252,2355,2470,2510,2599,2682,2856,2922,3614,3655,3797,3914,4036,4194,4644,4691,4733,4789,4853,4873,5094,5129,5212,5241],"sources":[22,37,42,44,45,52,58,134,155,165,178,184,259,301,310,339,402,476,482,486,489,490,494,501,502,518,554,721,739,782,1181,1317,1370,1447,1481,1511,1560,1566,1660,1738,1791,1792],"evidence":[134,370,466,983,1122,1197,1559,1634,1643,1682,1683,1684,1744,1769,1858,1905,2087,2419,2420,2633,2703,2704,2813,2899,3002,3117,3157,3158,3263,3264,3365,3366,3659,3775,4996,4997,5052,5255,5372,5494,5652,6102,6149,6194,6270,6354,6380,6381,6382,6738,6739,6801,6802,6951,6952,7004]},"version":"131evrz"}