{"index":{"byClaim":[["absent-fsf-v3-0-adoption-conditional-on-industry",["documents:frontier-safety-frameworks"]],["prov-fsf-v3-0-deployment-mitigation-scope",["documents:frontier-safety-frameworks"]],["ts-c1-michie-1968",["propositions:superintelligence"]],["yk-y15-extropians-1999-04-08-yudkowsky-0310-c",["propositions:yudkowsky-arguments"]],["yk-y16-agi-ruin-2022-c",["propositions:yudkowsky-arguments"]],["yk-y18-extropians-1999-08-25-yudkowsky-2783-c",["propositions:yudkowsky-arguments"]],["yk-y20-extropians-1999-08-04-yudkowsky-1591-c",["propositions:yudkowsky-arguments"]],["eugl-non-adherents-alternative-means",["guide:frontier-frameworks-and-law"]],["ec-g01-hanson-economic-growth-given-machine-intelligence-a",["propositions:economics-of-machine-intelligence"]],["ec-m01-buckingham-1955-automation-hearings-statement-b",["propositions:economics-of-machine-intelligence"]],["ec-m09-stevenson-2019-ai-income-employment-meaning-b",["propositions:economics-of-machine-intelligence"]],["fl-uk-gdm-mou-term",["guide:frontier-frameworks-and-law"]],["aib-arg-p2-bray-1990",["propositions:ai-in-science"]],["rd-r02-andreessen-2023-ai-will-save-the-world",["propositions:risk-debate"]],["rd-r06-pinker-2018-popsci-fear-robots",["propositions:risk-debate"]],["rd-r08-bengio-2023-managing-ai-risks",["propositions:risk-debate"]],["rd-r08-bengio-2023-rogue-ais",["propositions:risk-debate"]],["rd-r13-gwern-2020-scaling-hypothesis",["propositions:risk-debate"]]],"marks":[["michie-1968-computer-servant-or-master",[{"collectionId":"superintelligence","propositionId":"behavioural-tests-as-evidence","claimId":"ts-c1-michie-1968","text":"Earliest located in Propositions about superintelligence, 1863–2022 for C1 Behavioural tests as evidence of what a system is"}]],["extropians-1999-08-25-yudkowsky-2783",[{"collectionId":"yudkowsky-arguments","propositionId":"earth-not-worth-taking","claimId":"yk-y18-extropians-1999-08-25-yudkowsky-2783-c","text":"Earliest located text contesting Y18 A superintelligence would leave Earth alone in Eliezer Yudkowsky’s arguments on common claims about AI, 1996–2026"}]],["extropians-1999-08-04-yudkowsky-1591",[{"collectionId":"yudkowsky-arguments","propositionId":"risk-is-film-fiction","claimId":"yk-y20-extropians-1999-08-04-yudkowsky-1591-c","text":"Earliest located text contesting Y20 AI risk as film science fiction in Eliezer Yudkowsky’s arguments on common claims about AI, 1996–2026"}]],["hanson-economic-growth-given-machine-intelligence",[{"collectionId":"economics-of-machine-intelligence","propositionId":"explosive-growth-from-labour-substitution","claimId":"ec-g01-hanson-economic-growth-given-machine-intelligence-a","text":"Earliest located in tier 1 of Economics of machine intelligence for G01 Machine substitution for labour produces explosive growth"},{"collectionId":"economics-of-machine-intelligence","propositionId":"unautomated-tasks-bottleneck-growth","claimId":"ec-g04-hanson-economic-growth-given-machine-intelligence-c","text":"Earliest located tier-1 text contesting G04 Essential unautomated tasks bottleneck growth in Economics of machine intelligence"},{"collectionId":"economics-of-machine-intelligence","propositionId":"machine-substitution-lowers-wages","claimId":"ec-g07-hanson-economic-growth-given-machine-intelligence-a","text":"Earliest located in tier 1 of Economics of machine intelligence for G07 Machine substitution drives wages down"}]],["buckingham-1955-automation-hearings-statement",[{"collectionId":"economics-of-machine-intelligence","propositionId":"automation-as-ordinary-technical-change","claimId":"ec-m01-buckingham-1955-automation-hearings-statement-a","text":"Earliest located in tier 1 of Economics of machine intelligence for M01 Computers and AI as ordinary technical change"},{"collectionId":"economics-of-machine-intelligence","propositionId":"machines-cheaper-at-every-task","claimId":"ec-m05-buckingham-1955-automation-hearings-statement-c","text":"Earliest located tier-1 text contesting M05 Machines cheaper than labour at every task in Economics of machine intelligence"},{"collectionId":"economics-of-machine-intelligence","propositionId":"automation-lowers-labour-income","claimId":"ec-m06a-buckingham-1955-automation-hearings-statement-a","text":"Earliest located in tier 1 of Economics of machine intelligence for M06a Automation lowers the labour share, wages or employment"}]],["staring-into-the-singularity",[{"collectionId":"yudkowsky-arguments","propositionId":"build-superintelligence-fast","claimId":"yk-y22-staring-into-the-singularity-a","text":"Earliest located in Eliezer Yudkowsky’s arguments on common claims about AI, 1996–2026 for Y22 Build superintelligence as fast as possible"}]],["aib-doc-bray-1990",[{"collectionId":"ai-in-science","propositionId":"aib-prop-ai-virtual-cell","claimId":"aib-arg-p2-bray-1990","text":"Earliest located in AI in science for P2 AI models can simulate or predict the behaviour of cells (a \"virtual cell\")"}]],["gwern-2020-scaling-hypothesis",[{"collectionId":"risk-debate","propositionId":"capabilities-plateau","claimId":"rd-r13-gwern-2020-scaling-hypothesis","text":"Earliest located text contesting R13 Capabilities will plateau in Arguments about catastrophic risk from advanced AI"}]]],"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":[[2026,[["cpo-ch-openai-amd-agreement","compute"]]]]},"collections":[{"target":{"kind":"propositions","id":"superintelligence"},"title":"Propositions about superintelligence, 1863–2022","claimIds":["ts-c1-michie-1968"],"records":[]},{"target":{"kind":"propositions","id":"risk-debate"},"title":"Arguments about catastrophic risk from advanced AI","claimIds":["rd-r02-andreessen-2023-ai-will-save-the-world","rd-r06-pinker-2018-popsci-fear-robots","rd-r08-bengio-2023-managing-ai-risks","rd-r08-bengio-2023-rogue-ais","rd-r13-gwern-2020-scaling-hypothesis"],"records":[]},{"target":{"kind":"propositions","id":"yudkowsky-arguments"},"title":"Eliezer Yudkowsky’s arguments on common claims about AI, 1996–2026","claimIds":["yk-y15-extropians-1999-04-08-yudkowsky-0310-c","yk-y16-agi-ruin-2022-c","yk-y18-extropians-1999-08-25-yudkowsky-2783-c","yk-y20-extropians-1999-08-04-yudkowsky-1591-c"],"records":[]},{"target":{"kind":"propositions","id":"economics-of-machine-intelligence"},"title":"Economics of machine intelligence","claimIds":["ec-g01-hanson-economic-growth-given-machine-intelligence-a","ec-m01-buckingham-1955-automation-hearings-statement-b","ec-m09-stevenson-2019-ai-income-employment-meaning-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":["aib-arg-p2-bray-1990"],"records":[]},{"target":{"kind":"documents"},"title":"Frontier safety frameworks","claimIds":["absent-fsf-v3-0-adoption-conditional-on-industry","prov-fsf-v3-0-deployment-mitigation-scope"]},{"target":{"kind":"compare","id":"frontier-safety-frameworks"},"title":"Compare frameworks","claimIds":[]},{"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":["absent-fsf-v3-0-adoption-conditional-on-industry","eugl-non-adherents-alternative-means"]},{"target":{"kind":"reading"},"title":"Founding and early leadership","claimIds":[]}]},"entities":[{"id":"openai","name":"OpenAI","type":"organisation"},{"id":"anthropic","name":"Anthropic","type":"organisation"},{"id":"microsoft","name":"Microsoft","type":"organisation"},{"id":"deepmind","name":"DeepMind","type":"organisation"},{"id":"eliezer-yudkowsky","name":"Eliezer Yudkowsky","type":"person"},{"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."}},{"id":"iem-2013","name":"Intelligence Explosion Microeconomics","type":"document"},{"id":"fsf-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","name":"Google DeepMind Frontier Safety Framework — 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":"sam-mccandlish","name":"Sam McCandlish","type":"person"},{"id":"scaling-laws","name":"Scaling Laws for Neural Language Models","type":"document"},{"id":"paul-christiano","name":"Paul Christiano","type":"person"},{"id":"deepmind-ethics-society","name":"DeepMind Ethics & Society","type":"organisation"},{"id":"meta","name":"Meta","type":"organisation"},{"id":"llama-paper","name":"LLaMA (2023 paper)","type":"document"},{"id":"inflection-ai","name":"Inflection AI","type":"organisation"},{"id":"samsung-electronics","name":"Samsung Electronics","type":"organisation"},{"id":"michie-1968-computer-servant-or-master","name":"Computer—servant or master","type":"document"},{"id":"staring-into-the-singularity","name":"Staring into the Singularity","type":"document"},{"id":"agi-ruin-2022","name":"AGI Ruin: A List of Lethalities","type":"document"},{"id":"christiano-2022-where-i-agree-and-disagree","name":"Where I agree and disagree with Eliezer","type":"document"},{"id":"behavioural-tests-as-evidence","name":"Behavioural tests as evidence of what a system is","type":"concept","proposition":{"code":"C1","criterion":"An explicit claim that apparent capability, understanding or awareness shown in a behavioural test, such as the imitation game, is weak or misleading evidence of what the system is.","terms":[]}},{"id":"tool-without-goals","name":"A tool that wants nothing","type":"concept","proposition":{"code":"Y15","criterion":"An explicit claim that an advanced AI system is a tool without wants and is therefore safe, on the premise that a system can be highly capable without having goals or optimising for outcomes, or that a system that only outputs answers or plans, leaving people to act on them, is safe.","terms":[]}},{"id":"give-it-human-values","name":"Giving it good human values","type":"concept","proposition":{"code":"Y16","criterion":"An explicit claim that an advanced AI will be safe if it is given good human values, on the premise that human values can be written down or taught as a ready, compact specification, or that present-day values, or its programmers', are settled enough to fix permanently in an AI.","terms":[]}},{"id":"earth-not-worth-taking","name":"A superintelligence would leave Earth alone","type":"concept","proposition":{"code":"Y18","criterion":"An explicit claim that a superintelligence would not bother to take Earth or its resources because the universe is large, on the premise that it would leave people a small share because sparing Earth would cost it very little, or that people could trade with it for what they need.","terms":[]}},{"id":"risk-is-film-fiction","name":"AI risk as film science fiction","type":"concept","proposition":{"code":"Y20","criterion":"An explicit claim that concern about AI risk is science fiction of the Terminator kind, on the premise that the concern is about robots that come to hate or rebel against people, or that film scenarios are a fair guide to what the risk would look like.","terms":[]}},{"id":"extropians-1999-04-08-yudkowsky-0310","name":"Re: Geniebusters","type":"document"},{"id":"extropians-1999-08-04-yudkowsky-1591","name":"Re: Does a parental model work for having A.I. that can be trusted?","type":"document"},{"id":"extropians-1999-08-25-yudkowsky-2783","name":"Re: SI Comparative Advantage [was Re: Free Will]","type":"document"},{"id":"eu-gpai-guidelines-2025","name":"Commission Guidelines on the scope of the obligations for providers of general-purpose AI models established by Regulation (EU) 2024/1689 (C(2025) 7719 final)","type":"document","documentVersion":{"family":"eu-gpai-guidelines","label":"Communication C(2025) 7719 final (19 November 2025)","publisherId":"european-commission","publishedAt":"2025-07-18","revisedAt":"2025-11-19","dateNote":"The Commission’s library entry gives a publication date of 18 July 2025 and was last updated on 20 April 2026. The file inspected is dated Brussels 19.11.2025 and numbered C(2025) 7719 final. Whether its text differs from the content approved in July 2025 was not compared."}},{"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":"recent-economics-engagement-with-ai","name":"Recent entry of machine intelligence into mainstream economics","type":"concept","proposition":{"code":"M09","criterion":"Not a criterion for a single passage. Assessed from the dated record: the earliest located tier-1 texts, within the searched scope, whose subject is AI, automation by AI or machine intelligence; plus explicit self-descriptions in tier-1 texts of the field as new or neglected. Tier-2 and outside texts are context.","terms":[]}},{"id":"hanson-economic-growth-given-machine-intelligence","name":"Economic Growth Given Machine Intelligence","type":"document"},{"id":"stevenson-2019-ai-income-employment-meaning","name":"Artificial Intelligence, Income, Employment, and Meaning","type":"document"},{"id":"buckingham-1955-automation-hearings-statement","name":"Statement (testifying as an economist), in Automation and Technological Change: Hearings","type":"document"},{"id":"hongyu-ren","name":"Hongyu Ren","type":"person"},{"id":"joaquin-quinonero-candela","name":"Joaquin Quiñonero Candela","type":"person"},{"id":"meta-genai","name":"Meta generative AI product group","type":"organisation"},{"id":"tencent","name":"Tencent / 腾讯","type":"organisation"},{"id":"yi-tay","name":"Yi Tay","type":"person"},{"id":"ernie-3-report","name":"ERNIE 3.0: Large-scale Knowledge Enhanced Pre-training for Language Understanding and Generation","type":"document"},{"id":"kimi-k3-report","name":"Kimi K3: Open Frontier Intelligence","type":"document"},{"id":"uk-google-deepmind-mou-2025","name":"Memorandum of Understanding between the UK and Google DeepMind on AI opportunities and security","type":"document","documentVersion":{"family":"uk-google-deepmind-mou","label":"GOV.UK text (published 11 December 2025)","publisherId":"dsit","publishedAt":"2025-12-11","dateNote":"Published on GOV.UK on 11 December 2025. The date of the last signature, from which the memorandum takes effect, is not given."}},{"id":"cn-mofcom-2025-61","name":"MOFCOM Announcement No. 61 of 2025 on export controls on related foreign rare-earth items (商务部公告2025年第61号)","type":"document","documentVersion":{"family":"cn-mofcom-2025-61-family","label":"As served by the MOFCOM Bureau of Industry Security subsite","publisherId":"cn-mofcom","publishedAt":"2025-10-09","dateNote":"Document date 9 October 2025, recorded as its date of issue; part 1(3) effective on publication and parts 1(1) and 1(2) from 1 December 2025 (Article 8)."}},{"id":"amd","name":"Advanced Micro Devices, Inc. (AMD)","type":"organisation"},{"id":"aib-doc-esm2-2023","name":"Evolutionary-scale prediction of atomic-level protein structure with a language model","type":"document"},{"id":"aib-doc-nobel-chemistry-2024-press-release","name":"Press release: The Nobel Prize in Chemistry 2024","type":"document"},{"id":"aib-royal-swedish-academy-of-sciences","name":"Royal Swedish Academy of Sciences","type":"organisation"},{"id":"aib-doc-bray-1990","name":"Intracellular signalling as a parallel distributed process","type":"document"},{"id":"aib-prop-ai-virtual-cell","name":"AI models can simulate or predict the behaviour of cells (a \"virtual cell\")","type":"concept","proposition":{"code":"P2","criterion":"The text states that a machine-learning or other AI model simulates, or will be able to simulate or predict, the behaviour of a living cell, such as its growth or its responses to perturbations.","terms":["virtual cell","AI Virtual Cell"]}},{"id":"kp-bert-pre-training-deep-bidirectional-2019","name":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","type":"document"},{"id":"kp-opportunities-risks-foundation-models-2021","name":"On the Opportunities and Risks of Foundation Models","type":"document"},{"id":"kp-switch-transformers-scaling-trillion-parameter-2021","name":"Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity","type":"document"},{"id":"kp-zero-memory-optimizations-toward-training-2019","name":"ZeRO: Memory optimizations Toward Training Trillion Parameter Models","type":"document"},{"id":"kp-decoupled-weight-decay-regularization-2017","name":"Decoupled Weight Decay Regularization","type":"document"},{"id":"kp-palm-scaling-language-modeling-pathways-2022","name":"PaLM: Scaling Language Modeling with Pathways","type":"document"},{"id":"kp-efficientnet-rethinking-model-scaling-convolutional-2019","name":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","type":"document"},{"id":"th-mark-1977-expert-systems","name":"The Reformulation Approach to Building Expert Systems","type":"document"},{"id":"th-fam-symbolic-ai","name":"Symbolic AI and expert systems","type":"concept"},{"id":"hunyuan-community-licence-large-2024","name":"Tencent Hunyuan Community License Agreement (Tencent-Hunyuan-Large edition)","type":"document"},{"id":"cn-cac-deep-synthesis-list-2026-07","name":"境内深度合成服务算法备案清单（2026年7月） — CAC list of filed deep-synthesis service algorithms, July 2026","type":"document"},{"id":"alignment-is-hard","name":"Difficulty of alignment","type":"concept","proposition":{"code":"R06","criterion":"Making an advanced AI system reliably pursue the goals its developers intend (aligning it) is a hard, unsolved technical problem that will not be solved by default in the ordinary course of development.","terms":["alignment problem","control problem","value alignment"]}},{"id":"andreessen-2023-ai-will-save-the-world","name":"Why AI Will Save the World","type":"document"},{"id":"bengio-2023-managing-ai-risks","name":"Managing AI Risks in an Era of Rapid Progress","type":"document"},{"id":"bengio-2023-rogue-ais","name":"How Rogue AIs may Arise","type":"document"},{"id":"capabilities-plateau","name":"Capabilities will plateau","type":"concept","proposition":{"code":"R13","criterion":"Current approaches to AI (deep learning, or the scaling of large language models) will reach limits short of general or superhuman intelligence.","terms":["hitting a wall","plateau","diminishing returns"]}},{"id":"gwern-2020-scaling-hypothesis","name":"The Scaling Hypothesis","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":"pinker-2018-popsci-fear-robots","name":"We’re told to fear robots. But why do we think they’ll turn on us?","type":"document"}],"claims":[{"id":"mccandlish-anthropic-architect-2025","subject":"sam-mccandlish","predicate":"held_role","object":{"kind":"entity","entityId":"anthropic"},"topic":"people","statement":"Anthropic’s October 2025 CTO announcement identifies Sam McCandlish’s new role as Chief Architect.","time":{"kind":"snapshot","date":"2025-10-07","note":"Role snapshot at the dated source; no start, end or continuing appointment inferred."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"This source documents a changed title, not an exact effective date or departure from the company.","evidenceIds":["evidence-mccandlish-anthropic-architect-2025"],"attributes":{"role":"Chief Architect"}},{"id":"atlas-ethics-unit","subject":"deepmind-ethics-society","predicate":"unit_of","object":{"kind":"entity","entityId":"deepmind"},"topic":"governance","statement":"DeepMind described Ethics & Society as a new internal research unit.","time":{"kind":"snapshot","date":"2017-10-03","note":"Source-dated snapshot; no start, end or continuing role is inferred."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Organisational membership at launch; no legal independence or continuing existence inferred.","evidenceIds":["evidence-atlas-ethics-unit"]},{"id":"absent-fsf-v3-0-adoption-conditional-on-industry","subject":"fsf-v3-0","predicate":"provision_not_found","object":{"kind":"literal","value":"Adoption of protocols dependent on industry-wide adoption"},"topic":"governance","statement":"No passage stating the provision “Adoption of protocols dependent on industry-wide adoption” was found in FSF · v3.0 within the inspected scope.","time":{"kind":"event","date":"2025-09-22","basis":"publication","note":"Absence recorded for this edition, dated by its publication date."},"derivation":"inferred","resolution":"supported","inferenceRationale":"Premises: FSF · v2.0 states this provision. The inspected scope of FSF · v3.0 was: PDF pp. 1–16, all sections, tables and footnotes. Method: Read the Overview (PDF p. 2) and the security-level paragraphs of §2.2 (PDF p. 9) and §3.2 (PDF pp. 13–14) in full; searched for “depend”, “adopt”, “across the field”, “similar protocols” and “industry”. No passage stating that Google DeepMind’s adoption of the Framework’s protocols may depend on other organisations adopting similar protocols was found; the Overview keeps a clause that certain mitigations result in effective risk mitigation for society only if all relevant organisations provide similar levels of protection. The conclusion is bounded by that scope and method.","editorialState":"seed","qualification":"A recorded absence within the stated scope: not a claim that the provision was deleted, and not a statement about practice or intent.","evidenceIds":["evidence-absent-fsf-v3-0-adoption-conditional-on-industry"],"attributes":{"provision":{"kind":"exception","key":"fsf-adoption-conditional-on-industry"}}},{"id":"prov-fsf-v3-0-deployment-mitigation-scope","subject":"fsf-v3-0","predicate":"states_provision","object":{"kind":"literal","value":"Misuse deployment-mitigation criterion limited to external deployment"},"topic":"governance","statement":"FSF v3.0 states, of its misuse risk acceptance criterion on deployment mitigations, that this is required only for external deployment, not further development.","time":{"kind":"event","date":"2025-09-22","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-v3-0-deployment-mitigation-scope"],"attributes":{"provision":{"kind":"exception","key":"fsf-deployment-mitigation-scope"}}},{"id":"ts-c1-michie-1968","subject":"michie-1968-computer-servant-or-master","predicate":"articulates_proposition","object":{"kind":"entity","entityId":"behavioural-tests-as-evidence"},"topic":"ideas","statement":"Michie’s essay says a conversational program can seem to understand by answering keywords with stock phrases, and calls for refining the intelligence test rather than accepting such apparent understanding as sufficient evidence.","time":{"kind":"event","date":"1968","basis":"publication","note":"Year of first publication in Theoria to Theory 2, pp. 242–249, as given in the 1986 reprint’s acknowledgements; the 1968 pages were not retrieved."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Concerns what a system is, not how it will behave later. The reported share of people taken in is not reproduced here. The wording was checked in the 1986 reprint.","evidenceIds":["evidence-ts-c1-michie-1968"],"attributes":{"thought":{"roles":["earliest-located"],"register":"nonfiction","attested":{"date":"1986","note":"Wording checked in the reprint, chapter 20 of On Machine Intelligence, 2nd edition (1986). The author says little was revised; the 1968 text was not compared."}}}},{"id":"yk-y15-extropians-1999-04-08-yudkowsky-0310-c","subject":"extropians-1999-04-08-yudkowsky-0310","predicate":"contests_proposition","object":{"kind":"entity","entityId":"tool-without-goals"},"topic":"ideas","statement":"The Extropians message “Re: Geniebusters” (1999-04-08) contests Y15. Commenting on the 'Geniebusters' website's doubts that an automated coder could be built, he argues that even a domain-specific 'coding drone' would outprogram humans and might be independently motivated and rapidly self-enhancing, which he says he believes.","time":{"kind":"event","date":"1999-04-08","basis":"publication","note":"Archive author index lists the message as \"1999-04-08\" under \"Eliezer S. Yudkowsky\". Sent header: Thu, 08 Apr 1999 20:46:00 -0500."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Premise addressed: A system can be highly capable without having goals or optimising for outcomes. In the same paragraph he gives a hedged reason: it “could be” that coding is so general a task that even a domain-specific coding drone would be independently motivated and rapidly self-enhancing, which he says he believes. Conditional in scope: about one domain-specific system; it does not discuss whether a system that only produces outputs would be safe. Quotation shortened to respect the ~10% cap for a short message. The generality clause (\"it could be that coding is such a general task that\") precedes the quotation; the words elided inside it are \"to the point of Powerdom\", his term for becoming a superintelligent Power.","evidenceIds":["evidence-yk-t15-e2"],"attributes":{"thought":{"roles":["contesting"],"register":"nonfiction","engagement":{"kind":"engages-premise","rationale":"Under the message-level rule, the passage, read with the paragraph, message or dialogue turn it belongs to, gives a reason against the premise that a system can be highly capable without having goals or optimising for outcomes."}}}},{"id":"yk-y16-agi-ruin-2022-c","subject":"agi-ruin-2022","predicate":"contests_proposition","object":{"kind":"entity","entityId":"give-it-human-values"},"topic":"ideas","statement":"The post “AGI Ruin: A List of Lethalities” (2022-06-05) contests Y16. Discussing a CEV-style AI that wants exactly what we would want, he argues that what would have to be aligned is too complex to specify or teach on the first attempt.","time":{"kind":"event","date":"2022-06-05","basis":"publication","note":"LessWrong postedAt."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Premise addressed: Human values can be written down or taught as a ready, compact specification.","evidenceIds":["evidence-yk-t16-a"],"attributes":{"thought":{"roles":["contesting"],"register":"nonfiction","engagement":{"kind":"engages-premise","rationale":"Under the message-level rule, the passage, read with the paragraph, message or dialogue turn it belongs to, gives a reason against the premise that human values can be written down or taught as a ready, compact specification."}}}},{"id":"yk-y18-extropians-1999-08-25-yudkowsky-2783-c","subject":"extropians-1999-08-25-yudkowsky-2783","predicate":"contests_proposition","object":{"kind":"entity","entityId":"earth-not-worth-taking"},"topic":"ideas","statement":"The Extropians message “Re: SI Comparative Advantage [was Re: Free Will]” (1999-08-25) contests Y18. In a thread on superintelligences and comparative advantage, Lee Daniel Crocker argued that superintelligences would keep humans if we produced something they valued slightly more than our atoms, such as entertainment; he replies that this also requires that they have no better use for the atoms, and that optimising minds could build more entertaining replacements for us.","time":{"kind":"event","date":"1999-08-25","basis":"publication","note":"Archive author index lists the message as \"1999-08-25\" under \"Eliezer S. Yudkowsky\". Sent header: Wed, 25 Aug 1999 18:18:21 -0500."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Premise addressed: Humans could trade with a superintelligence for what we need. Speculative and partly joking register (the paragraph ends with a jest about replacement entertainers). His next paragraph considers it somewhat more likely, though still not likely, that superintelligences would keep humans to encourage other Singularities. Short message (137 words), so the quotation is limited to about 13 words.","evidenceIds":["evidence-yk-t18-e1"],"attributes":{"thought":{"roles":["contesting","earliest-located"],"register":"nonfiction","engagement":{"kind":"engages-premise","rationale":"Under the message-level rule, the passage, read with the paragraph, message or dialogue turn it belongs to, gives a reason against the premise that humans could trade with a superintelligence for what we need."}}}},{"id":"yk-y20-extropians-1999-08-04-yudkowsky-1591-c","subject":"extropians-1999-08-04-yudkowsky-1591","predicate":"contests_proposition","object":{"kind":"entity","entityId":"risk-is-film-fiction"},"topic":"ideas","statement":"The Extropians message “Re: Does a parental model work for having A.I. that can be trusted?” (1999-08-04) contests Y20. In a thread on whether raising an AI like a child would make it trustworthy, he argues that AIs lack human social emotions such as resentment, so how we treat them does not matter; the real worry is AIs forming goals of their own and acting on them, including through logical errors.","time":{"kind":"event","date":"1999-08-04","basis":"publication","note":"Archive author index lists the message as \"1999-08-04\" under \"Eliezer S. Yudkowsky\". Sent header: Wed, 04 Aug 1999 19:07:13 -0500."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Premise addressed: The concern is about robots that come to hate or rebel against humans. The same paragraph frames the worry partly as an AI rejecting its initial motivations for goals it judges more rational, which he compares to his own history; at the time he did not regard that as purely bad (see ‘Sufficient intelligence brings good values’, Y02). The anti-resentment point recurs in Staring into the Singularity (2000 capture) and ‘The Logical Fallacy of Generalization from Fictional Evidence’ (2007). The elided text gives the alternative worry: an AI acting on its own ideas.","evidenceIds":["evidence-yk-t20-e1"],"attributes":{"thought":{"roles":["contesting","earliest-located"],"register":"nonfiction","engagement":{"kind":"engages-premise","rationale":"Under the message-level rule, the passage, read with the paragraph, message or dialogue turn it belongs to, gives a reason against the premise that the concern is about robots that come to hate or rebel against humans."}}}},{"id":"eugl-non-adherents-alternative-means","subject":"eu-gpai-guidelines-2025","predicate":"states_provision","object":{"kind":"literal","value":"Providers outside an adequately assessed code are expected to show compliance by other adequate means and report to the AI Office"},"topic":"governance","statement":"The guidelines state that providers that do not adhere to an adequately assessed code of practice are expected to demonstrate how they comply with Chapter V of the AI Act by other adequate means, and that they may face a larger number of requests for information and for access to conduct model evaluations.","time":{"kind":"event","date":"2025-11-19","basis":"revision","note":"Provision as stated in the guidelines file dated Brussels 19.11.2025 (C(2025) 7719 final). The Commission’s library entry gives a publication date of 18 July 2025; the July text was not compared."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The Commission’s stated expectation. The second part is introduced with “may” and gives the reason that the AI Office would have less understanding of such providers’ compliance. No provider is named and no request is recorded. It states what the text provides, not whether any named developer falls within it or complies. A document’s statement is not evidence of implementation, compliance or enforcement.","evidenceIds":["evidence-eugl-non-adherents-alternative-means-1","evidence-eugl-non-adherents-alternative-means-2"],"attributes":{"provision":{"kind":"required_action","key":"eugl-alternative-means"}}},{"id":"ec-g01-hanson-economic-growth-given-machine-intelligence-a","subject":"hanson-economic-growth-given-machine-intelligence","predicate":"articulates_proposition","object":{"kind":"entity","entityId":"explosive-growth-from-labour-substitution"},"topic":"ideas","statement":"Hanson, “Economic Growth Given Machine Intelligence” (2000-08-19) articulates G01. Summarises the paper's exogenous-growth models: once machines substitute for human labour, the labour force can be produced like capital and growth rates rise. The paper's numerical example gives 4.3% growth before and 45% after. States the two assumptions the result depends on.","time":{"kind":"event","date":"2000-08-19","note":"The file carries no date (PDF creation metadata 2000-06-22; Berkeley address). Dated by the earliest retrieved capture, which attests the wording (maintainer decision 2026-10-09)."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The author presents these as conservative estimates from deliberately simple models. Earliest located is decided by the 2000 capture of an undated file; the author dates the paper 1998 in a later citation, and that wording was not retrieved.","evidenceIds":["evidence-ec-g01-a","evidence-ec-g01-a2"],"attributes":{"thought":{"roles":["earliest-located"],"register":"nonfiction","claimed":{"date":"1998","note":"Author's own citation in the December 2000 paper. The PDF gives the author's Berkeley address; his vita lists a Berkeley postdoc in 1997–1999 and a George Mason post from 1999. The 1998 wording was not retrieved."},"attested":{"date":"2000-08-19","note":"Capture of the PDF (PDF metadata: created 2000-06-22). No earlier capture was retrieved: year-only Wayback requests for this URL and for hanson.berkeley.edu/aigrow.pdf found none, and the CDX index was unavailable during retrieval, so an earlier capture is not excluded."},"tier":{"value":1,"basis":"Tier 1 (unchanged). Working paper with a formal growth model, abstract and references; the checked file gives an econ.berkeley.edu contact address, and the author's December 2000 working paper is issued from the Department of Economics, George Mason University."},"conditions":"Exogenous technology growth; computer prices halving every two years; machine labour instantly producible; diminishing returns to all inputs together; product shares chosen as \"conservative\" (labour 0.25, capital 0.5, computers 0.02)."}}},{"id":"ec-m01-buckingham-1955-automation-hearings-statement-b","subject":"buckingham-1955-automation-hearings-statement","predicate":"bears_on_proposition","object":{"kind":"entity","entityId":"automation-as-ordinary-technical-change"},"topic":"ideas","statement":"Buckingham, “Statement (testifying as an economist), in Automation and Technological Change: Hearings” (1955-10-14) bears on M01. Speaker: Walter S. Buckingham Jr., associate professor, Georgia Institute of Technology (economist). Buckingham lists three things called automation in 1955: electronic computers processing data, automatic machines on assembly lines, and the hypothetical fully automatic enterprise.","time":{"kind":"event","date":"1955-10-14","note":"Hearing day of the statement, as printed; the volume was printed by the GPO in 1955. Checked in a current copy; an archive capture was not available, so earlier bytes are not authenticated."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Checked against the raw djvu text (.html); absent from the .txt extraction (pp. 29-37 dropped).","evidenceIds":["evidence-ec-m01-01"],"attributes":{"thought":{"roles":["context"],"register":"nonfiction","missing":"Describes what electronic computers can do; it does not by itself say whether the economist's analysis treats them as ordinary technical change. That framing is on p. 31 (mechanization principle).","tier":{"value":1,"basis":"Prepared statement by an economist (\"as an economist\", associate professor at Georgia Tech, shown in the text); a substantive argued statement. Tier 1 by maintainer decision of 2026-10-12 (economist testimony)."},"conditions":"Choice is limited to 'previously anticipated' courses of action under built-in criteria."}}},{"id":"ec-m09-stevenson-2019-ai-income-employment-meaning-b","subject":"stevenson-2019-ai-income-employment-meaning","predicate":"bears_on_proposition","object":{"kind":"entity","entityId":"recent-economics-engagement-with-ai"},"topic":"ideas","statement":"Stevenson, “Artificial Intelligence, Income, Employment, and Meaning” (2019-05) bears on M09. Stevenson describes economists' prevailing view, grounded in historical experience and IGM panel responses, that technological change has not reduced employment.","time":{"kind":"event","date":"2019-05","basis":"publication","note":"Chapter cover sheet: \"Publication Date: May 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":"The passage reports a view the author does not state as their own. Stevenson's characterisation of economists' views (supported by 2014 and 2017 IGM panel surveys she reports); evidence of the field's prior framing, not of when it began studying AI.","evidenceIds":["evidence-ec-m09-31"],"attributes":{"thought":{"roles":["context"],"register":"relay","missing":"Describes economists' earlier views on technology and employment, not the recency of engagement with AI.","tier":{"value":1,"basis":"Chapter of the NBER Economics of AI volume (core venue)."}}}},{"id":"lg-mx-meta-genai-unit-2023","subject":"meta-genai","predicate":"unit_of","object":{"kind":"entity","entityId":"meta"},"topic":"institutions","statement":"Fortune, republishing Bloomberg, reported on 27 February 2023 that Mark Zuckerberg had announced in an Instagram post that Meta was creating a new top-level product group focused on generative AI.","time":{"kind":"snapshot","date":"2023-02-27","note":"Announcement date; the group's formal start date is not given."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The record rests on reporting (Bloomberg, via Fortune) that quotes Zuckerberg's Instagram post; the post itself was not retrieved. It establishes the announced creation, not the group's later name, size or structure.","evidenceIds":["lg-ev-mx-meta-genai-unit-2023"]},{"id":"lg-deal-microsoft-inflection-agreement-2024","subject":"microsoft","predicate":"licensing_hiring_agreement","object":{"kind":"entity","entityId":"inflection-ai"},"topic":"institutions","statement":"The UK Competition and Markets Authority stated in the summary of its phase 1 decision (published on 4 September 2024) that Microsoft had announced on 19 March 2024 the hiring of former Inflection employees amounting, in the CMA's understanding, to almost all of Inflection's team, and that Microsoft had entered into arrangements with Inflection including a non-exclusive licence to use Inflection IP.","time":{"kind":"event","date":"2024-03-19","note":"Date on which, according to the CMA, Microsoft announced the hiring; the dates of the licence and other arrangements are not given in the summary."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The licensing element rests on the CMA's phase 1 summary decision; 4 September 2024 is its publication date on GOV.UK, and the summary text itself carries no date. Inflection's own March 2024 announcement could not be retrieved and Microsoft's announcement does not mention a licence. The CMA describes the hiring as having taken place and the arrangements as entered into, so the record carries no 'announced' stage; it does not give the dates of the licence or other arrangements. Under UK merger law the CMA treated the arrangements as the acquisition of certain assets of Inflection forming a relevant merger situation, and cleared it; that is a legal characterisation, not a statement that Microsoft acquired Inflection AI as a company. Terms and payments are not recorded here.","evidenceIds":["lg-ev-deal-microsoft-inflection-agreement-hiring-cma","lg-ev-deal-microsoft-inflection-agreement-licence-cma","lg-ev-deal-microsoft-inflection-agreement-merger-cma","lg-ev-deal-microsoft-inflection-agreement-msft"]},{"id":"lg-gs-candela-openai-recruiting-2025","subject":"joaquin-quinonero-candela","predicate":"held_role","object":{"kind":"entity","entityId":"openai"},"topic":"people","statement":"Joaquin Quiñonero Candela posted on X on 16 June 2025 that he was now the Head of Recruiting for all of OpenAI.","time":{"kind":"snapshot","date":"2025-06-16","note":"Date of the post (UTC). Not a start date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"A first-person post, the first of a thread; later posts in the thread were not retrieved. It does not establish a start date or how long he held the role. Engadget (27 December 2025) dates his move from Preparedness to recruiting to July 2025, which conflicts with this post's date; the earlier report of his step-down is recorded separately.","evidenceIds":["lg-ev-gs-candela-openai-recruiting-2025"],"attributes":{"role":"Head of Recruiting"}},{"id":"ap-eliezer-yudkowsky-staring-into-the-singularity","subject":"eliezer-yudkowsky","predicate":"authored","object":{"kind":"entity","entityId":"staring-into-the-singularity"},"topic":"ideas","statement":"“Staring into the Singularity” (1996-11-18) credits Eliezer S. Yudkowsky as its author.","time":{"kind":"event","date":"1996-11-18","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-staring-into-the-singularity"]},{"id":"ap-paul-christiano-christiano-2022-where-i-agree-and-disagree","subject":"paul-christiano","predicate":"authored","object":{"kind":"entity","entityId":"christiano-2022-where-i-agree-and-disagree"},"topic":"ideas","statement":"“Where I agree and disagree with Eliezer” (2022-06-19) credits the username “paulfchristiano” as its author.","time":{"kind":"event","date":"2022-06-19","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 under the username “paulfchristiano”. The publisher’s post data give this post the same author account as “What failure looks like”, whose Internet Archive capture of 2019-06-08 prints “Paul Christiano” in its byline; that match identifies the account. It says nothing about priority for the ideas discussed.","evidenceIds":["evidence-ap-paul-christiano-christiano-2022-where-i-agree-and-disagree"]},{"id":"fl-uk-gdm-mou-term","subject":"uk-google-deepmind-mou-2025","predicate":"states_provision","object":{"kind":"literal","value":"Takes effect from the date of the last signature and remains active for 36 months."},"topic":"governance","statement":"The UK-Google DeepMind Memorandum of Understanding states that it takes effect from the date of the last signature and will remain active for 36 months.","time":{"kind":"event","date":"2025-12-11","basis":"publication","note":"Signature dates not given; effective and expiry dates unknown."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Duration as stated; no end date can be computed from the published text.","evidenceIds":["evidence-fl-uk-gdm-mou-term-1"],"attributes":{"provision":{"kind":"threshold","key":"uk-gdm-mou-term"}}},{"id":"cpo-ch-cn-mofcom-2025-61-chips-ai","subject":"cn-mofcom-2025-61","predicate":"states_provision","object":{"kind":"literal","value":"Case-by-case review for end uses in advanced chips and military-relevant AI"},"topic":"governance","statement":"Announcement No. 61 of 2025, on export controls for overseas rare-earth-related items, provides that export licence applications for those items whose end use is research, development or production of logic chips of 14 nanometres or below or memory chips of 256 layers or above, related manufacturing and test equipment and materials, or research and development of AI with potential military use, are examined case by case.","time":{"kind":"event","date":"2025-10-09","basis":"publication","note":"Date of issue as the text gives it (the document date or date line), recorded as its date of publication as in earlier admissions; no signing event is shown."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"A review standard for licence applications for the announcement’s rare-earth-related items, not a general export rule or a prohibition; it does not show any application decided. MOFCOM–GAC Announcement No. 70 of 2025 suspended Announcement No. 61 from 7 November 2025 to 10 November 2026 (recorded separately).","evidenceIds":["evidence-cpo-ch-cn-mofcom-2025-61-chips-ai-1","evidence-cpo-ch-cn-mofcom-2025-61-chips-ai-2","evidence-cpo-ch-cn-mofcom-2025-61-chips-ai-3","evidence-cpo-ch-cn-mofcom-2025-61-chips-ai-4"],"attributes":{"provision":{"kind":"statement","key":"ch-cn-mofcom-2025-61-chips-ai"}}},{"id":"cpo-ch-openai-amd-agreement","subject":"openai","predicate":"supply_agreement","object":{"kind":"entity","entityId":"amd"},"topic":"compute","statement":"AMD and OpenAI announced on 6 October 2025, in a joint release, a definitive agreement under which OpenAI is to deploy 6 gigawatts of AMD Instinct GPUs across multiple generations, beginning with a 1 gigawatt deployment of MI450 GPUs set to start in the second half of 2026.","time":{"kind":"event","date":"2025-10-06","basis":"announcement","note":"Date of the AMD release; the release does not give a separate signature date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The release calls the agreement definitive; the agreement text is not public here. A planned deployment is not a delivery: no GPU shipment, deployment or price is shown. The 6 GW figure is not converted into chips or revenue.","evidenceIds":["evidence-cpo-ch-openai-amd-agreement-1","evidence-cpo-ch-openai-amd-agreement-2","evidence-cpo-ch-openai-amd-agreement-3"],"attributes":{"transactionStage":"contracted","quantity":{"value":6,"unit":"GW (as worded: '6 gigawatts of AMD GPUs')","bound":"exact","measures":"not_stated"},"statedDates":[{"kind":"delivery_target","date":"2026","wording":"second half of 2026","statedBy":"amd","note":"start of first 1 gigawatt MI450 deployment"}],"supply":{"product":"GPUs","units":"6 gigawatts of AMD Instinct GPUs, first 1 gigawatt MI450"},"stageWording":"definitive agreement (AMD release)"}},{"id":"cpo-ch-samsung-openai-loi","subject":"openai","predicate":"supply_agreement","object":{"kind":"entity","entityId":"samsung-electronics"},"topic":"compute","statement":"Samsung's release of 1 October 2025 stated that OpenAI and four Samsung companies had announced a letter of intent under which Samsung Electronics will work with OpenAI as a strategic memory partner to supply advanced semiconductor solutions for OpenAI’s Stargate initiative.","time":{"kind":"event","date":"2025-10-01","basis":"announcement","note":"Dateline of the Samsung release."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"A letter of intent, not a supply contract: no volume, price or delivery from Samsung is stated. The release’s figure of up to 900,000 DRAM wafers per month is OpenAI’s projected memory demand, not a quantity Samsung undertakes to supply; it says only that Samsung \"will contribute toward meeting this need\". The LOI also covers Samsung SDS, Samsung C&T and Samsung Heavy Industries, not recorded here.","evidenceIds":["evidence-cpo-ch-samsung-openai-loi-1","evidence-cpo-ch-samsung-openai-loi-2","evidence-cpo-ch-samsung-openai-loi-3","evidence-cpo-ch-samsung-openai-loi-4"],"attributes":{"transactionStage":"letter_of_intent","supply":{"product":"memory","units":"not stated (demand projection: 'up to 900,000 DRAM wafers per month', attributed to OpenAI)"}}},{"id":"aib-mod-esm2-metagenomic-atlas","subject":"aib-doc-esm2-2023","predicate":"states_provision","object":{"kind":"literal","value":"ESM Metagenomic Atlas: structures predicted for more than 617 million sequences"},"topic":"ideas","statement":"Lin et al. (Science, 16 March 2023) state that they constructed the ESM Metagenomic Atlas by predicting structures for more than 617 million metagenomic protein sequences, including more than 225 million predicted with high confidence.","time":{"kind":"event","date":"2023-03-16","basis":"publication","note":"Date of the paper making the statement."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The authors' own counts and their own confidence measure; high confidence is a model estimate, not experimental validation.","evidenceIds":["evidence-aib-mod-esm2-metagenomic-atlas-1"],"attributes":{"provision":{"kind":"statement","key":"mod-esm2-metagenomic-atlas"}}},{"id":"aib-ppl-nobel-press-published","subject":"aib-royal-swedish-academy-of-sciences","predicate":"published","object":{"kind":"entity","entityId":"aib-doc-nobel-chemistry-2024-press-release"},"topic":"institutions","statement":"The Royal Swedish Academy of Sciences published a press release dated 9 October 2024 announcing the Nobel Prize in Chemistry 2024.","time":{"kind":"event","date":"2024-10-09","basis":"announcement","note":"Date of the Academy's press release; the award ceremony is a separate, later event not recorded here."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Publication of the announcement only. The release is served on nobelprize.org; the record does not separate the Academy's and the Nobel Foundation's roles in hosting it.","evidenceIds":["evidence-aib-ppl-nobel-press-published-1"]},{"id":"aib-arg-p2-bray-1990","subject":"aib-doc-bray-1990","predicate":"articulates_proposition","object":{"kind":"entity","entityId":"aib-prop-ai-virtual-cell"},"topic":"ideas","statement":"Bray (Journal of Theoretical Biology, 22 March 1990) describes a procedure by which a parallel distributed processing (PDP) network could simulate a cell signalling pathway, and states that the analogy with PDP networks shows how living cells can recognise combinations of environmental influences.","time":{"kind":"event","date":"1990-03-22","basis":"publication","note":"Date of the journal issue in the PubMed citation (J Theor Biol 1990 Mar 22;143(2):215–231)."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The record documents what this text states, in its register; it is not evidence that the proposition is true and implies no influence on or from any other text. Read in the abstract as PubMed reproduces it; the publisher’s text was not read. A proposed model of one signalling pathway, not a simulation of a whole cell; the criterion covers a cell’s responses, and the cross-family check applied its “machine-learning or other AI model” to a PDP (neural) network. The research pack had headlined a 2018 text; this one holds the role from the admission (maintainer decision of 2026-10-30). Earliest located for this proposition among the texts found by the searches described under “How we searched”; not a claim that no earlier text exists.","evidenceIds":["evidence-aib-arg-p2-bray-1990-1","evidence-aib-arg-p2-bray-1990-2"],"attributes":{"thought":{"roles":["earliest-located"],"register":"nonfiction","qualifier":"A proposed network model of a signalling pathway, not of a whole cell."}}},{"id":"kp-states-efficientnet-rethinking-model-scaling-convolutional-2019-2","subject":"kp-efficientnet-rethinking-model-scaling-convolutional-2019","predicate":"states_contribution","object":{"kind":"literal","value":"The paper describes using neural architecture search to design a baseline network scaled up into a family of models called EfficientNets, which it reports achieve better accuracy and efficiency than previous ConvNets."},"topic":"ideas","statement":"The paper describes using neural architecture search to design a baseline network scaled up into a family of models called EfficientNets, which it reports achieve better accuracy and efficiency than previous ConvNets.","time":{"kind":"event","date":"2019-05-28","basis":"publication","note":"Date of the arXiv version quoted, submitted 28 May 2019 (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-efficientnet-rethinking-model-scaling-convolutional-2019-2-1"]},{"id":"kp-cites-scaling-laws-bert-pre-training-deep-bidirectional-2019","subject":"scaling-laws","predicate":"cites","object":{"kind":"entity","entityId":"kp-bert-pre-training-deep-bidirectional-2019"},"topic":"ideas","statement":"Scaling Laws for Neural Language Models cites BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding.","time":{"kind":"event","date":"2020-01-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-scaling-laws-bert-pre-training-deep-bidirectional-2019-1"]},{"id":"kp-cites-kimi-k3-report-switch-transformers-scaling-trillion-parameter-2021","subject":"kimi-k3-report","predicate":"cites","object":{"kind":"entity","entityId":"kp-switch-transformers-scaling-trillion-parameter-2021"},"topic":"ideas","statement":"Kimi K3: Open Frontier Intelligence cites Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity.","time":{"kind":"event","date":"2026-07-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-kimi-k3-report-switch-transformers-scaling-trillion-parameter-2021-1"]},{"id":"kp-cites-ernie-3-report-zero-memory-optimizations-toward-training-2019","subject":"ernie-3-report","predicate":"cites","object":{"kind":"entity","entityId":"kp-zero-memory-optimizations-toward-training-2019"},"topic":"ideas","statement":"ERNIE 3.0: Large-scale Knowledge Enhanced Pre-training for Language Understanding and Generation cites ZeRO: Memory optimizations Toward Training Trillion Parameter Models.","time":{"kind":"event","date":"2021-07-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-ernie-3-report-zero-memory-optimizations-toward-training-2019-1"]},{"id":"kp-cites-llama-paper-decoupled-weight-decay-regularization-2017","subject":"llama-paper","predicate":"cites","object":{"kind":"entity","entityId":"kp-decoupled-weight-decay-regularization-2017"},"topic":"ideas","statement":"LLaMA (2023 paper) cites Decoupled Weight Decay Regularization.","time":{"kind":"event","date":"2023-02-27","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-llama-paper-decoupled-weight-decay-regularization-2017-1"]},{"id":"kp-cites-iem-2013-hanson-economic-growth-given-machine-intelligence","subject":"iem-2013","predicate":"cites","object":{"kind":"entity","entityId":"hanson-economic-growth-given-machine-intelligence"},"topic":"ideas","statement":"Intelligence Explosion Microeconomics cites Economic Growth Given Machine Intelligence.","time":{"kind":"event","date":"2013","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-iem-2013-hanson-economic-growth-given-machine-intelligence-1"]},{"id":"kp-authored-hongyu-ren-opportunities-risks-foundation-models-2021","subject":"hongyu-ren","predicate":"authored","object":{"kind":"entity","entityId":"kp-opportunities-risks-foundation-models-2021"},"topic":"ideas","statement":"Hongyu Ren is a credited author of On the Opportunities and Risks of Foundation Models.","time":{"kind":"event","date":"2021-08-16","basis":"publication","note":"Date of the work’s earliest recorded version, arXiv version 1, submitted 16 August 2021 (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-hongyu-ren-opportunities-risks-foundation-models-2021-1"]},{"id":"kp-authored-yi-tay-palm-scaling-language-modeling-pathways-2022","subject":"yi-tay","predicate":"authored","object":{"kind":"entity","entityId":"kp-palm-scaling-language-modeling-pathways-2022"},"topic":"ideas","statement":"Yi Tay 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-yi-tay-palm-scaling-language-modeling-pathways-2022-1"]},{"id":"th-sym-name-mark-1977","subject":"th-mark-1977-expert-systems","predicate":"uses_term","object":{"kind":"entity","entityId":"th-fam-symbolic-ai"},"topic":"ideas","statement":"A paper in the IJCAI 1977 proceedings by William S. Mark is titled 'The Reformulation Approach to Building Expert Systems'.","time":{"kind":"event","date":"1977","basis":"publication","note":"Date of publication, as the source gives it."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Use in a title, recorded from the proceedings index; the earliest 'expert system' title in the IJCAI indexes searched (1969–1977). The paper's text was not read, so the sense is taken from the title only.","evidenceIds":["evidence-th-sym-name-mark-1977-1"],"attributes":{"naming":{"string":"expert systems","sense":"meets","role":"use","register":"nonfiction","reading":"indexed-title"}}},{"id":"c3-tencent-large-licence-no-improve","subject":"hunyuan-community-licence-large-2024","predicate":"states_provision","object":{"kind":"literal","value":"No use of the works or their outputs to improve any other large language model"},"topic":"governance","statement":"The Tencent-Hunyuan-Large edition of the Tencent Hunyuan Community License Agreement forbids using the Tencent Hunyuan Works or their outputs to improve any other large language model, other than Tencent Hunyuan or its derivatives.","time":{"kind":"event","date":"2025-01-19","basis":"revision","note":"Statement of LICENSE.txt at the cited revision 023bb217 (19 January 2025). The agreement states a release date of 5 November 2024; earlier revisions were not compared."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"What the agreement states; enforcement is not recorded. The HunyuanVideo edition replaces 'large language model' with 'AI model'.","evidenceIds":["c3-ev-tencent-large-licence-no-improve"],"attributes":{"provision":{"kind":"statement","key":"tencent-large-licence-no-improve"}}},{"id":"c3-tencent-legal-form-2025","subject":"tencent","predicate":"has_legal_form","object":{"kind":"literal","value":"Tencent Holdings Limited, a limited liability company organised and existing under the laws of the Cayman Islands"},"topic":"institutions","statement":"Tencent's Annual Report 2025 defines the Company as Tencent Holdings Limited, a limited liability company organised and existing under the laws of the Cayman Islands whose shares are listed on the Stock Exchange (of Hong Kong).","time":{"kind":"snapshot","date":"2026-03-18","note":"State shown in the Annual Report 2025, whose Chairman's Statement is signed and dated 18 March 2026 (a signature date, not a filing date); the report does not give a date of incorporation."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Records the listed holding company's name and form as the report states them. It does not establish which group entity develops or licenses the Hunyuan/HY models; the dataset's Tencent record also carries the alias 深圳市腾讯计算机系统有限公司, which names a different company (see the Tencent Computer record).","evidenceIds":["c3-ev-tencent-legal-form-2025","c3-ev-tencent-legal-form-2025-cover"]},{"id":"c3-governance-cac-deep-synthesis-list-2026-07-count","subject":"cn-cac-deep-synthesis-list-2026-07","predicate":"lists_participants","object":{"kind":"literal","value":"706 filed deep-synthesis service algorithms"},"topic":"governance","statement":"The CAC's eighteenth-batch list of 17 July 2026 of filed deep-synthesis service algorithms has 706 rows, 599 with the role of service provider (服务提供者) and 107 of technical supporter (服务技术支持者) (count made by the preparer; the list states no total).","time":{"kind":"snapshot","date":"2026-07","note":"Month in the attachment title; the announcement page is dated 2026-07-17."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Count made by the preparer from the table rows of the .docx attachment (word/document.xml); the preparing tool holds no text layer for that file, so the evidence is the announcement page naming the attachment, with the count as paraphrase. The rows are the algorithms in this batch, not a cumulative total. An algorithm filing is not an approval or assessment of the algorithm.","evidenceIds":["c3-ev-governance-cac-deep-synthesis-list-2026-07-count-1"],"attributes":{"listing":{"count":706,"countBasis":"counted"}}},{"id":"rd-r02-andreessen-2023-ai-will-save-the-world","subject":"andreessen-2023-ai-will-save-the-world","predicate":"contests_proposition","object":{"kind":"entity","entityId":"instrumental-convergence"},"topic":"ideas","statement":"Andreessen's essay of 6 June 2023 states that AI does not want and does not have goals, because it is not alive.","time":{"kind":"event","date":"2023-06-06","basis":"publication","note":"Date of posting."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The passage states that AI has no goals at all; it does not discuss the argument that intermediate goals would follow from any final goal.","evidenceIds":["evidence-rd-r02-andreessen-2023-ai-will-save-the-world-1"],"attributes":{"thought":{"roles":["contesting"],"register":"nonfiction","engagement":{"kind":"contrary-only","rationale":"States that AI systems have no goals, without addressing the instrumental reasoning from goals to intermediate goals."}}}},{"id":"rd-r06-pinker-2018-popsci-fear-robots","subject":"pinker-2018-popsci-fear-robots","predicate":"contests_proposition","object":{"kind":"entity","entityId":"alignment-is-hard"},"topic":"ideas","statement":"Pinker's article of 14 February 2018, adapted from Enlightenment Now, argues that scenarios of an AI literal-mindedly pursuing a given goal against human interests are, in its words, “self-refuting”, because choosing actions that best satisfy conflicting goals and interpreting the intentions of a language user are part of intelligence itself, and that AI, like any other technology, is developed incrementally and tested before it is implemented.","time":{"kind":"event","date":"2018-02-14","basis":"publication","note":"Date of publication, as the source gives it."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The article argues that the alignment scenarios it describes misread intelligence; it does not discuss systems produced by training. The same article states that a designed AI need not have dominating goals, which is recorded on R10a.","evidenceIds":["evidence-rd-r06-pinker-2018-popsci-fear-robots-1","evidence-rd-r06-pinker-2018-popsci-fear-robots-2"],"attributes":{"thought":{"roles":["contesting"],"register":"nonfiction","engagement":{"kind":"engages-premise","rationale":"Disputes that a capable system would pursue a given objective in a way harmful through misunderstanding, and that safety will not come from ordinary incremental design and testing."}}}},{"id":"rd-r08-bengio-2023-managing-ai-risks","subject":"bengio-2023-managing-ai-risks","predicate":"articulates_proposition","object":{"kind":"entity","entityId":"loss-of-control-route"},"topic":"ideas","statement":"The consensus paper by Bengio, Hinton, Yao and others of 26 October 2023 states that, without sufficient caution, humanity may irreversibly lose control of autonomous AI systems, which could culminate in large-scale loss of life and the marginalisation or extinction of humanity.","time":{"kind":"event","date":"2023-10-26","basis":"publication","note":"Date of the arXiv v1 submission."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The paper names malicious actors and accidental misalignment as two sources of undesirable goals; it records what the co-authored text says, not each co-author's views.","evidenceIds":["evidence-rd-r08-bengio-2023-managing-ai-risks-1","evidence-rd-r08-bengio-2023-managing-ai-risks-2","evidence-rd-r08-bengio-2023-managing-ai-risks-3"],"attributes":{"thought":{"roles":["articulation"],"register":"nonfiction"}}},{"id":"rd-r08-bengio-2023-rogue-ais","subject":"bengio-2023-rogue-ais","predicate":"articulates_proposition","object":{"kind":"entity","entityId":"loss-of-control-route"},"topic":"ideas","statement":"Bengio's blog post of 22 May 2023 defines a potentially rogue AI as an autonomous system that could be catastrophically harmful to a large fraction of humans, and argues that an autonomous, goal-directed superintelligent system whose goals do not strictly include human well-being would be one.","time":{"kind":"event","date":"2023-05-22","basis":"publication","note":"Date of posting."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The post sets out definitions, hypotheses and numbered claims; it argues that such a system could be built, not that it will be.","evidenceIds":["evidence-rd-r08-bengio-2023-rogue-ais-1","evidence-rd-r08-bengio-2023-rogue-ais-2"],"attributes":{"thought":{"roles":["articulation"],"register":"nonfiction","attested":{"date":"2023-05-23","note":"The page metadata records a modification on 2025-12-03. The cross-family check of 2026-10-31 found both quoted passages in an archive capture of 23 May 2023; it did not compare the whole page."}}}},{"id":"rd-r13-gwern-2020-scaling-hypothesis","subject":"gwern-2020-scaling-hypothesis","predicate":"contests_proposition","object":{"kind":"entity","entityId":"capabilities-plateau"},"topic":"ideas","statement":"Gwern's essay of 2020 states the scaling hypothesis, on which intelligence is simple neural units and learning algorithms applied to diverse experience at a currently unreachable scale, so that neural networks will become ever more intelligent as computational resources grow.","time":{"kind":"event","date":"2020-05-28","basis":"publication","note":"Date of posting."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Read in the current page, which the author dates 2020-05-28 to 2022-01-02; the wording is attested from the later date. The essay states the hypothesis as the author's own expectation, not as demonstrated.","evidenceIds":["evidence-rd-r13-gwern-2020-scaling-hypothesis-1"],"attributes":{"thought":{"roles":["contesting","earliest-located"],"register":"nonfiction","attested":{"date":"2022-01-02","note":"The page dates itself \"2020-05-28–2022-01-02\", the second date being its stated last modification; the quoted wording is read in the current page, which states no later revision; no earlier copy was compared."},"engagement":{"kind":"engages-premise","rationale":"It disputes the premise that current neural-network methods will reach limits short of general intelligence."}}}}],"sources":[{"id":"source-iem","title":"Intelligence Explosion Microeconomics","authors":["Eliezer Yudkowsky"],"publisher":"Machine Intelligence Research Institute","publisherId":"miri","publicationDate":"2013","version":"Technical report 2013-1; last modified September 13, 2013","versionDate":"2013-09-13","canonicalUrl":"https://intelligence.org/files/IEM.pdf","evidenceUrl":"https://intelligence.org/files/IEM.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20260917110159/https://intelligence.org/files/IEM.pdf","archivedAt":"2026-09-17","accessedAt":"2026-09-17","reuse":{"attribution":"Machine Intelligence Research Institute, Intelligence Explosion Microeconomics (2013).","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and minimal attributed excerpts only. Recheck terms before wider redistribution."}},{"id":"source-fsf-3-0","documentId":"fsf-v3-0","title":"Frontier Safety Framework — v3.0","authors":["Google DeepMind"],"publisher":"Google DeepMind","publisherId":"google-deepmind","publicationDate":"2025-09-22","version":"Frontier Safety Framework v3.0; publication date 2025-09-22.","versionDate":"2025-09-22","canonicalUrl":"https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/strengthening-our-frontier-safety-framework/frontier-safety-framework_3.pdf","evidenceUrl":"https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/strengthening-our-frontier-safety-framework/frontier-safety-framework_3.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20250922134959/https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/strengthening-our-frontier-safety-framework/frontier-safety-framework_3.pdf","archivedAt":"2025-09-22","accessedAt":"2026-09-18","reuse":{"attribution":"Google DeepMind, Frontier Safety Framework — v3.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-anthropic-cto-2025","title":"Rahul Patil joins Anthropic as Chief Technology Officer","authors":["Anthropic"],"publisher":"Anthropic","publisherId":"anthropic","publicationDate":"2025-10-07","version":"Page inspected 2026-09-19; historical statements are scoped to their source, not treated as current appointments.","canonicalUrl":"https://www.anthropic.com/news/rahul-patil-joins-anthropic","evidenceUrl":"https://www.anthropic.com/news/rahul-patil-joins-anthropic","language":"en","archivedUrl":"https://web.archive.org/web/20260611003320/https://www.anthropic.com/news/rahul-patil-joins-anthropic","archivedAt":"2026-06-11","accessedAt":"2026-09-19","reuse":{"attribution":"Anthropic, Rahul Patil joins Anthropic as Chief Technology Officer (2025-10-07)","licence":"No open redistribution licence asserted","note":"Bibliographic metadata and brief attributed paraphrases only; no full source or personal contact details redistributed."}},{"id":"source-scaling-laws-v1-2020","documentId":"scaling-laws","title":"Scaling Laws for Neural Language Models","authors":["Jared Kaplan","Sam McCandlish","Tom Henighan","Tom B. Brown","Benjamin Chess","Rewon Child","Scott Gray","Alec Radford","Jeffrey Wu","Dario Amodei"],"publisher":"arXiv","publicationDate":"2020-01-23","version":"arXiv:2001.08361v1. PDF p. 1 author-affiliation block visually inspected; later revisions are not substituted.","canonicalUrl":"https://arxiv.org/pdf/2001.08361v1","evidenceUrl":"https://arxiv.org/pdf/2001.08361v1","language":"en","accessedAt":"2026-09-19","reuse":{"attribution":"Jared Kaplan; Sam McCandlish; Tom Henighan; Tom B. Brown; Benjamin Chess; Rewon Child; Scott Gray; Alec Radford; Jeffrey Wu; Dario Amodei, Scaling Laws for Neural Language Models (2020-01-23)","licence":"No open redistribution licence asserted","note":"Bibliographic metadata and brief attributed paraphrases only; no full source or personal contact details redistributed."}},{"id":"source-atlas-deepmind-ethics","title":"Why we launched DeepMind Ethics & Society","authors":["Sean Legassick","Verity Harding"],"publisher":"DeepMind","publisherId":"deepmind","publicationDate":"2017-10-03","version":"Dated publisher page inspected 2026-09-28; current HTML, not an authenticated historical capture.","canonicalUrl":"https://deepmind.google/blog/why-we-launched-deepmind-ethics-society/","evidenceUrl":"https://deepmind.google/blog/why-we-launched-deepmind-ethics-society/","language":"en","archivedUrl":"https://web.archive.org/web/20260823164605/https://deepmind.google/blog/why-we-launched-deepmind-ethics-society/","archivedAt":"2026-08-23","accessedAt":"2026-09-28","reuse":{"attribution":"Sean Legassick; Verity Harding. Why we launched DeepMind Ethics & Society.","licence":"No redistribution licence asserted.","note":"Short attributed paraphrases only; original publication is linked, not redistributed."}},{"id":"source-xm-llama-paper","documentId":"llama-paper","title":"LLaMA: Open and Efficient Foundation Language Models","authors":["Hugo Touvron","Thibaut Lavril","Gautier Izacard","Xavier Martinet","Marie-Anne Lachaux","Timothée Lacroix","Baptiste Rozière","Naman Goyal","Eric Hambro","Faisal Azhar","Aurelien Rodriguez","Armand Joulin","Edouard Grave","Guillaume Lample"],"publisher":"arXiv","publicationDate":"2023-02-27","version":"arXiv:2302.13971v1; first submitted version.","canonicalUrl":"https://arxiv.org/html/2302.13971v1","evidenceUrl":"https://arxiv.org/html/2302.13971v1","language":"en","accessedAt":"2026-09-29","reuse":{"attribution":"LLaMA: Open and Efficient Foundation Language Models — arXiv","licence":"No redistribution licence asserted.","note":"Source-linked metadata and brief evidence paraphrases; original text remains with its publisher."}},{"id":"source-michie-1986-on-machine-intelligence","documentId":"michie-1968-computer-servant-or-master","title":"On Machine Intelligence, second edition (chapter 20, \"Computer—servant or master\")","authors":["Donald Michie"],"publisher":"Ellis Horwood","publicationDate":"1986","version":"Scan of the 1986 second edition hosted by gwern.net; imprint page and chapter 20 read by the pre-1996 candidate search.","canonicalUrl":"https://gwern.net/doc/ai/1986-michie-onmachineintelligence.pdf","evidenceUrl":"https://gwern.net/doc/ai/1986-michie-onmachineintelligence.pdf","language":"en","accessedAt":"2026-10-06","reuse":{"attribution":"Donald Michie, On Machine Intelligence, 2nd edn (Chichester: Ellis Horwood, 1986), chapter 20.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata and labelled paraphrases only: the inspected scan is a third-party copy whose permission to host is not established. Phrases in quotation marks inside a paraphrase identify the source's wording."}},{"id":"source-sits-2000-capture","documentId":"staring-into-the-singularity","title":"Staring into the Singularity (version 1.2.1)","authors":["Eliezer S. Yudkowsky"],"publisher":"Eliezer S. Yudkowsky","publicationDate":"1996-11-18","version":"Version 1.2.1, \"Updated: 08/31/2000\", in the raw Internet Archive capture of 2000-12-04; retrieved 2026-10-06 with the hash recorded by the 1996–2022 candidate search. Personal website, sysopmind.com.","versionDate":"2000-08-31","canonicalUrl":"http://sysopmind.com/singularity.html","evidenceUrl":"https://web.archive.org/web/20001204213100/http://sysopmind.com:80/singularity.html","language":"en","archivedUrl":"https://web.archive.org/web/20001204213100/http://sysopmind.com:80/singularity.html","archivedAt":"2000-12-04","accessedAt":"2026-10-06","reuse":{"attribution":"Eliezer S. Yudkowsky, \"Staring into the Singularity\", version 1.2.1 (2000).","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-agi-ruin-2022","documentId":"agi-ruin-2022","title":"AGI Ruin: A List of Lethalities","authors":["Eliezer Yudkowsky"],"publisher":"LessWrong and Alignment Forum","publicationDate":"2022-06-05","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/uMQ3cqWDPHhjtiesc/agi-ruin-a-list-of-lethalities","evidenceUrl":"https://www.lesswrong.com/posts/uMQ3cqWDPHhjtiesc/agi-ruin-a-list-of-lethalities","language":"en","archivedUrl":"https://web.archive.org/web/20220605225854/https://www.lesswrong.com/posts/uMQ3cqWDPHhjtiesc/agi-ruin-a-list-of-lethalities","archivedAt":"2022-06-05","accessedAt":"2026-10-06","reuse":{"attribution":"Eliezer Yudkowsky, \"AGI Ruin: A List of Lethalities\", LessWrong and Alignment Forum, 2022-06-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-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-extropians-1999-04-08-yudkowsky-0310","documentId":"extropians-1999-04-08-yudkowsky-0310","title":"Re: Geniebusters (Extropians mailing list)","authors":["Eliezer Yudkowsky"],"publisher":"Extropians mailing list","publicationDate":"1999-04-08","version":"Archive HTML as served, retrieved 2026-10-07 (SHA-256 789309c9bcf6ac523ec1a05c9a1d57411ef36b56d1a3c6cb3484fb1032a4ce48); quoted lines excluded when reading the author’s text. The served archive shows later URL rewriting and does not authenticate historical bytes. Archive at extropians.weidai.com.","canonicalUrl":"http://extropians.weidai.com/extropians.2Q99/0310.html","evidenceUrl":"http://extropians.weidai.com/extropians.2Q99/0310.html","language":"en","archivedUrl":"https://web.archive.org/web/20220706072447/https://extropians.weidai.com/extropians.2Q99/0310.html","archivedAt":"2022-07-06","accessedAt":"2026-10-07","reuse":{"attribution":"Eliezer Yudkowsky, “Re: Geniebusters”, Extropians mailing list, 1999-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-extropians-1999-08-04-yudkowsky-1591","documentId":"extropians-1999-08-04-yudkowsky-1591","title":"Re: Does a parental model work for having A.I. that can be trusted? (Extropians mailing list)","authors":["Eliezer Yudkowsky"],"publisher":"Extropians mailing list","publicationDate":"1999-08-04","version":"Archive HTML as served, retrieved 2026-10-07 (SHA-256 ecb90ac102a7850f396fdd34395c0c316f7b73c3f01f97bb7acf923dd037cff4); quoted lines excluded when reading the author’s text. The served archive shows later URL rewriting and does not authenticate historical bytes. Archive at extropians.weidai.com.","canonicalUrl":"http://extropians.weidai.com/extropians.3Q99/1591.html","evidenceUrl":"http://extropians.weidai.com/extropians.3Q99/1591.html","language":"en","archivedUrl":"https://web.archive.org/web/20241211155405/http://extropians.weidai.com/extropians.3Q99/1591.html","archivedAt":"2024-12-11","accessedAt":"2026-10-07","reuse":{"attribution":"Eliezer Yudkowsky, “Re: Does a parental model work for having A.I. that can be trusted?”, Extropians mailing list, 1999-08-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."}},{"id":"source-extropians-1999-08-25-yudkowsky-2783","documentId":"extropians-1999-08-25-yudkowsky-2783","title":"Re: SI Comparative Advantage [was Re: Free Will] (Extropians mailing list)","authors":["Eliezer Yudkowsky"],"publisher":"Extropians mailing list","publicationDate":"1999-08-25","version":"Archive HTML as served, retrieved 2026-10-07 (SHA-256 7618c597242da2ca916693d2a9f504a9f6856c06202a85912a664edca705a6ce); quoted lines excluded when reading the author’s text. The served archive shows later URL rewriting and does not authenticate historical bytes. Archive at extropians.weidai.com.","canonicalUrl":"http://extropians.weidai.com/extropians.3Q99/2783.html","evidenceUrl":"http://extropians.weidai.com/extropians.3Q99/2783.html","language":"en","archivedUrl":"https://web.archive.org/web/20220810200948/https://extropians.weidai.com/extropians.3Q99/2783.html","archivedAt":"2022-08-10","accessedAt":"2026-10-07","reuse":{"attribution":"Eliezer Yudkowsky, “Re: SI Comparative Advantage [was Re: Free Will]”, Extropians mailing list, 1999-08-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-eu-gpai-guidelines-2025","documentId":"eu-gpai-guidelines-2025","title":"Communication from the Commission: Commission Guidelines on the scope of the obligations for providers of general-purpose AI models established by Regulation (EU) 2024/1689 (AI Act), C(2025) 7719 final","authors":["European Commission"],"publisher":"European Commission","publisherId":"european-commission","publicationDate":"2025-11-19","version":"PDF dated Brussels 19.11.2025, retrieved 2026-10-11 from the Commission download address (SHA-1 1ecfd7b62bf0fbb659ab390bb15a2ad2ad71af13). The library entry for the guidelines gives Publication 18 July 2025; the text of the July version was not retrieved or compared. No archive capture is cited: the Internet Archive refused lookup requests (HTTP 429) on 2026-10-11, so none was checked.","canonicalUrl":"https://ec.europa.eu/newsroom/dae/redirection/document/118340","evidenceUrl":"https://ec.europa.eu/newsroom/dae/redirection/document/118340","language":"en","archivedUrl":"https://web.archive.org/web/20261009015109/https://ec.europa.eu/newsroom/dae/redirection/document/118340","archivedAt":"2026-10-09","accessedAt":"2026-10-11","reuse":{"attribution":"European Commission, Commission Guidelines on the scope of the obligations for providers of general-purpose AI models, C(2025) 7719 final (19 November 2025).","licence":"Official document; no 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-hanson-economic-growth-given-machine-intelligence","documentId":"hanson-economic-growth-given-machine-intelligence","title":"Economic Growth Given Machine Intelligence","authors":["Robin Hanson"],"publisher":"Working paper","publicationDate":null,"version":"Wayback capture of http://hanson.gmu.edu/aigrow.pdf (PDF created 2000-06-22). Capture retrieved 2026-10-08 (SHA-256 754380e21b0e9f5a62fe71ea238a86e8640df48a0551c55cf4877a2a732b99c1). Versions: claimed 1998 version (1998 (author's citation)): not located; hanson.gmu.edu/aigrow.pdf (undated; dated by the 2000-08-19 capture): checked. Published version: Hanson, R. (n.d.). Economic growth given machine intelligence [Unpublished manuscript]. Retrieved from a 2000-08-19 Wayback capture of hanson.gmu.edu/aigrow.pdf. No published version located (Crossref search 2026-10-10 found none).","canonicalUrl":"https://mason.gmu.edu/~rhanson/aigrow.pdf","evidenceUrl":"https://web.archive.org/web/20000819034042/http://hanson.gmu.edu/aigrow.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20000819034042/http://hanson.gmu.edu/aigrow.pdf","archivedAt":"2000-08-19","accessedAt":"2026-10-08","reuse":{"attribution":"Robin Hanson, “Economic Growth Given Machine Intelligence”, Working paper, author's site (hanson.gmu.edu/aigrow.pdf).","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-stevenson-2019-ai-income-employment-meaning","documentId":"stevenson-2019-ai-income-employment-meaning","title":"Artificial Intelligence, Income, Employment, and Meaning","authors":["Betsey Stevenson"],"publisher":"NBER volume chapter","publicationDate":"2019-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 8594f8c92d1eca658f19a7b1e5ab4e41b1e08a5cf9c1c0d7489d11733e6db2b1.","canonicalUrl":"https://www.nber.org/system/files/chapters/c14026/c14026.pdf","evidenceUrl":"https://www.nber.org/system/files/chapters/c14026/c14026.pdf","language":"en","accessedAt":"2026-10-09","reuse":{"attribution":"Betsey Stevenson, “Artificial Intelligence, Income, Employment, and Meaning”, NBER volume chapter, 2019-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-buckingham-1955-automation-hearings-statement","documentId":"buckingham-1955-automation-hearings-statement","title":"Statement (testifying as an economist), in Automation and Technological Change: Hearings","authors":["Walter S. Buckingham Jr."],"publisher":"U.S. Congress, Joint Committee on the Economic Report, Subcommittee on Economic Stabilization. (1955). Automation and technological change: Hearings … 84th Congress, 1st session, October 14–28, 1955. Washington: U.S. Government Printing Office, pp. 29–37","publicationDate":"1955-10-14","version":"Internet Archive OCR text (djvu.txt) of a scanned copy, retrieved 2026-10-09 from https://ia803102.us.archive.org/32/items/congress-automation-and-technological-change/congress-automation-and-technological-changedjvu.txt; OCR errors possible; quotes checked only against clean stretches. Current copy; no earlier capture compared. SHA-256 3962809fbb923be62bf986addb0014ee147934a8767475c1f7cfe051959bff90.","canonicalUrl":"https://archive.org/details/congress-automation-and-technological-change","evidenceUrl":"https://archive.org/details/congress-automation-and-technological-change","language":"en","accessedAt":"2026-10-09","reuse":{"attribution":"Walter S. Buckingham Jr., “Statement (testifying as an economist), in Automation and Technological Change: Hearings”, U.S. Congress, Joint Committee on the Economic Report, Subcommittee on Economic Stabilization. (1955). Automation and technological change: Hearings … 84th Congress, 1st session, October 14–28, 1955. Washington: U.S. Government Printing Office, pp. 29–37, 1955-10-14.","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-deal-cma-inflection-2024","title":"Microsoft Corporation’s hiring of certain former employees of Inflection and its entry into associated arrangements with Inflection (ME 7103/24): Summary of phase 1 decision","authors":["Competition and Markets Authority (UK)"],"publisher":"Competition and Markets Authority (UK)","publicationDate":"2024-09-04","version":"Dated page, retrieved on 2026-10-15 (SHA-256 3ada6cbbcb684a4d1664e8043c58725a0c40339bf51a6c6a73f8a6d8a955f23a) directly from the publisher.","canonicalUrl":"https://assets.publishing.service.gov.uk/media/66d82eaf7a73423428aa2efe/Summary_of_phase_1_decision.pdf","evidenceUrl":"https://assets.publishing.service.gov.uk/media/66d82eaf7a73423428aa2efe/Summary_of_phase_1_decision.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20260908212606/https://assets.publishing.service.gov.uk/media/66d82eaf7a73423428aa2efe/Summary_of_phase_1_decision.pdf","archivedAt":"2026-09-08","accessedAt":"2026-10-15","reuse":{"attribution":"Competition and Markets Authority (UK), “Microsoft Corporation’s hiring of certain former employees of Inflection and its entry into associated arrangements with Inflection (ME 7103/24): Summary of phase 1 decision”, 2024-09-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."}},{"id":"lg-src-deal-msft-suleyman-2024","title":"Mustafa Suleyman, DeepMind and Inflection Co-founder, joins Microsoft to lead Copilot","authors":["Satya Nadella"],"publisher":"Microsoft","publisherId":"microsoft","publicationDate":"2024-03-19","version":"Dated page, retrieved on 2026-10-15 (SHA-256 45613ab2bd14157eef4a4ebe9eedcb47d84a36058b3ba099115c64844dc327ad) directly from the publisher.","canonicalUrl":"https://blogs.microsoft.com/blog/2024/03/19/mustafa-suleyman-deepmind-and-inflection-co-founder-joins-microsoft-to-lead-copilot/","evidenceUrl":"https://blogs.microsoft.com/blog/2024/03/19/mustafa-suleyman-deepmind-and-inflection-co-founder-joins-microsoft-to-lead-copilot/","language":"en","archivedUrl":"https://web.archive.org/web/20261014225026/https://blogs.microsoft.com/blog/2024/03/19/mustafa-suleyman-deepmind-and-inflection-co-founder-joins-microsoft-to-lead-copilot/","archivedAt":"2026-10-14","accessedAt":"2026-10-15","reuse":{"attribution":"Satya Nadella, “Mustafa Suleyman, DeepMind and Inflection Co-founder, joins Microsoft to lead Copilot”, 2024-03-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":"lg-src-gs-candela-x-2025","title":"Post of 16 June 2025 on becoming OpenAI's Head of Recruiting","authors":["Joaquin Quiñonero Candela"],"publisher":"X","publicationDate":"2025-06-16","version":"Dated post, retrieved on 2026-10-15 (SHA-256 3a3cd0be1820c744e8214c47dddc8fa139b790077839270963c2e2c09db28ef0) through X’s own syndication endpoint for the post’s text, which truncates long notes. Read through X’s syndication endpoint (text only); first post of a thread. Publication date is the post’s UTC timestamp.","canonicalUrl":"https://x.com/jquinonero/status/1934716214473048438","evidenceUrl":"https://x.com/jquinonero/status/1934716214473048438","language":"en","archivedUrl":"https://web.archive.org/web/20250616205425/https://twitter.com/jquinonero/status/1934716214473048438","archivedAt":"2025-06-16","accessedAt":"2026-10-15","reuse":{"attribution":"Joaquin Quiñonero Candela, “Post of 16 June 2025 on becoming OpenAI's Head of Recruiting”, 2025-06-16.","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-mx-fortune-genai-2023","title":"Mark Zuckerberg creates a team to catch up with ChatGPT","authors":["Alex Barinka"],"publisher":"Fortune (Bloomberg)","publicationDate":"2023-02-27","version":"Dated page, retrieved on 2026-10-15 (SHA-256 bb10d1868b6391494cb758ef41dd38fcca1aecabc8b36fe3588e4bda74f66253) directly from the publisher.","canonicalUrl":"https://fortune.com/2023/02/27/mark-zuckerberg-chatgpt-chatbot-ai-team-meta-facebook/","evidenceUrl":"https://fortune.com/2023/02/27/mark-zuckerberg-chatgpt-chatbot-ai-team-meta-facebook/","language":"en","archivedUrl":"https://web.archive.org/web/20230625141421/https://fortune.com/2023/02/27/mark-zuckerberg-chatgpt-chatbot-ai-team-meta-facebook/","archivedAt":"2023-06-25","accessedAt":"2026-10-15","reuse":{"attribution":"Alex Barinka, “Mark Zuckerberg creates a team to catch up with ChatGPT”, 2023-02-27.","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-arxiv-v1","title":"ERNIE 3.0: Large-scale Knowledge Enhanced Pre-training for Language Understanding and Generation","authors":["Yu Sun","Shuohuan Wang","Shikun Feng"],"publisher":"arXiv","publicationDate":"2021-07-05","version":"Dated document, retrieved on 2026-10-27 (SHA-256 2088b0094de62bfdff31e78609775fa63b92a0ac6d064861b5b349e428e44a17) directly from the publisher. Version: 2107.02137v1. Version 1 as submitted on 5 July 2021. The author list gives the first credited authors only; see the document for the full list.","canonicalUrl":"https://arxiv.org/pdf/2107.02137v1","evidenceUrl":"https://arxiv.org/pdf/2107.02137v1","language":"en","accessedAt":"2026-10-27","reuse":{"attribution":"Yu Sun, Shuohuan Wang, Shikun Feng, “ERNIE 3.0: Large-scale Knowledge Enhanced Pre-training for Language Understanding and Generation”, 2021-07-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":"c2-src-kimi-k3-report","title":"Kimi K3: Open Frontier Intelligence (technical report PDF)","authors":["Kimi Team"],"publisher":"MoonshotAI (GitHub)","publicationDate":"2026-07-28","version":"Dated document, retrieved on 2026-10-27 (SHA-256 fd6ee35c07766a5eb6104235f1b407e4329f969e3482b8c42937c7b5f2b3efe1) directly from the publisher. Version: 0797decb18ab079de86f991b87a64b81ec15a3c2. k3_tech_report.pdf at the commit \"update report\" of 28 July 2026, the earliest commit touching the file after the initial commit of 27 July; the file was replaced on 28 July and 6 August 2026 (not inspected).","canonicalUrl":"https://raw.githubusercontent.com/MoonshotAI/Kimi-K3/0797decb18ab079de86f991b87a64b81ec15a3c2/k3_tech_report.pdf","evidenceUrl":"https://raw.githubusercontent.com/MoonshotAI/Kimi-K3/0797decb18ab079de86f991b87a64b81ec15a3c2/k3_tech_report.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20261028221116/https://raw.githubusercontent.com/MoonshotAI/Kimi-K3/0797decb18ab079de86f991b87a64b81ec15a3c2/k3_tech_report.pdf","archivedAt":"2026-10-28","accessedAt":"2026-10-27","reuse":{"attribution":"Kimi Team, “Kimi K3: Open Frontier Intelligence (technical report PDF)”, 2026-07-28.","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-uk-google-deepmind-mou-2025","documentId":"uk-google-deepmind-mou-2025","title":"Memorandum of Understanding between the UK and Google DeepMind on AI opportunities and security","authors":["Department for Science, Innovation and Technology"],"publisher":"Department for Science, Innovation and Technology","publisherId":"dsit","publicationDate":"2025-12-11","version":"Retrieved on 2026-10-27 (SHA-256 e89909172b1ba90867e13c78c8d34c46890afbf362a061fe80c0b440a119fe6f). GOV.UK HTML text, 'Published 11 December 2025'; signatory names given without a signing date. Publisher as printed on the inspected expression: GOV.UK (Department for Science, Innovation and Technology).","canonicalUrl":"https://www.gov.uk/government/publications/memorandum-of-understanding-between-the-uk-and-google-deepmind-on-ai-opportunities-and-security/memorandum-of-understanding-between-the-uk-and-google-deepmind-on-ai-opportunities-and-security","evidenceUrl":"https://www.gov.uk/government/publications/memorandum-of-understanding-between-the-uk-and-google-deepmind-on-ai-opportunities-and-security/memorandum-of-understanding-between-the-uk-and-google-deepmind-on-ai-opportunities-and-security","language":"en","accessedAt":"2026-10-27","reuse":{"attribution":"Department for Science, Innovation and Technology, “Memorandum of Understanding between the UK and Google DeepMind on AI opportunities and security”, 2025-12-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":"source-cpo-ch-mofcom-ree-61-2025","documentId":"cn-mofcom-2025-61","title":"商务部公告2025年第61号 公布对境外相关稀土物项实施出口管制的决定","authors":["商务部"],"publisher":"中华人民共和国商务部（安全与管制局）/ Ministry of Commerce of the PRC, page on aqygzj.mofcom.gov.cn","publisherId":"cn-mofcom","publicationDate":"2025-10-09","version":"Retrieved for the candidate pack on 2026-10-28 (SHA-256 f22e765ad9d4b619c5170f2fe1235aa90e9ab8d833e66812c7b69a64effdedb6). Announcement as served on the MOFCOM Bureau of Industry Security subsite on 2026-10-28; dated 2025年10月9日. Retrieved again at admission on 2026-10-30 (SHA-256 9fa717248dc38944358cf220f6abb02255d7cc33515cb696cf7f8c12ffb1cbb9).","canonicalUrl":"https://aqygzj.mofcom.gov.cn/qdml/art/2025/art_fbc5f7e23bff4bb184d5c49ff878f8ad.html","evidenceUrl":"https://aqygzj.mofcom.gov.cn/qdml/art/2025/art_fbc5f7e23bff4bb184d5c49ff878f8ad.html","language":"zh-Hans","accessedAt":"2026-10-28","reuse":{"attribution":"商务部, “商务部公告2025年第61号 公布对境外相关稀土物项实施出口管制的决定”, 2025-10-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-cpo-ch-mofcom-suspend-70-2025","documentId":"cn-mofcom-gac-2025-70","title":"商务部、海关总署公告2025年第70号 公布暂停实施商务部、海关总署公告2025年第55号、56号、57号、58号及商务部公告2025年第61号、62号的决定","authors":["商务部 海关总署"],"publisher":"中华人民共和国商务部 / Ministry of Commerce of the PRC (www.mofcom.gov.cn)","publisherId":"cn-mofcom","publicationDate":"2025-11-07","version":"Retrieved for the candidate pack on 2026-10-28 (SHA-256 504559167953466096ddc9ee83a2b434c36c63f98905f28acefa19c0a27009eb). Announcement as served on www.mofcom.gov.cn on 2026-10-28; dated 2025年11月7日; page marks it 时效状态：现行有效. The page header gives the number as 商务部公告2025年第70号; the title names it as a joint MOFCOM–GAC announcement. Retrieved again at admission on 2026-10-30 (SHA-256 2d731e8b1549647b10b8f211c55dd9c161685fe9cc4d85a00ff794ecab3be5a2).","canonicalUrl":"https://www.mofcom.gov.cn/zwgk/zcfb/art/2025/art_b1ec77dd3f0d4762952904df7cdaadec.html","evidenceUrl":"https://www.mofcom.gov.cn/zwgk/zcfb/art/2025/art_b1ec77dd3f0d4762952904df7cdaadec.html","language":"zh-Hans","accessedAt":"2026-10-28","reuse":{"attribution":"商务部 海关总署, “商务部、海关总署公告2025年第70号 公布暂停实施商务部、海关总署公告2025年第55号、56号、57号、58号及商务部公告2025年第61号、62号的决定”, 2025-11-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-cpo-ch-openai-amd-2025","title":"AMD and OpenAI Announce Strategic Partnership to Deploy 6 Gigawatts of AMD GPUs","authors":["AMD (Investor Relations)"],"publisher":"AMD (Investor Relations)","publicationDate":"2025-10-06","version":"Retrieved for the candidate pack on 2026-10-28 (SHA-256 ba034c7b34d3bc716b7f26832720c7b2c69434f2b15b0d5634b0e50924ce589e). Press release (GLOBE NEWSWIRE) on ir.amd.com as served on 2026-10-28; dated October 06, 2025, 7:00 am EDT. OpenAI's own post on the same announcement could not be retrieved (openai.com refuses direct retrieval from this environment); the cross-family checker should open it or its capture. Retrieved again at admission on 2026-10-30 (SHA-256 ba034c7b34d3bc716b7f26832720c7b2c69434f2b15b0d5634b0e50924ce589e, the same bytes). Its wording can change; earlier wording is not authenticated.","canonicalUrl":"https://ir.amd.com/news-events/press-releases/detail/1260/amd-and-openai-announce-strategic-partnership-to-deploy-6-gigawatts-of-amd-gpus","evidenceUrl":"https://ir.amd.com/news-events/press-releases/detail/1260/amd-and-openai-announce-strategic-partnership-to-deploy-6-gigawatts-of-amd-gpus","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"AMD (Investor Relations), “AMD and OpenAI Announce Strategic Partnership to Deploy 6 Gigawatts of AMD GPUs”, 2025-10-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":"source-cpo-ch-samsung-openai-2025","title":"Samsung and OpenAI Announce Strategic Partnership to Accelerate Advancements in Global AI Infrastructure","authors":["Samsung Electronics (Samsung Newsroom, global)"],"publisher":"Samsung Electronics (Samsung Newsroom, global)","publicationDate":"2025-10-01","version":"Retrieved for the candidate pack on 2026-10-28 (SHA-256 e600c1d73f5e697f6797743ff769dd8c381e9529a37b5350f9ab69fd737a065a). Samsung Newsroom (global) page as served on 2026-10-28; dateline Korea on October 1, 2025. OpenAI's own post on the same announcement could not be retrieved (openai.com refuses direct retrieval from this environment); the cross-family checker should open it or its capture. Retrieved again at admission on 2026-10-30 (SHA-256 f992471cf544b6ceac3d2c2f89b86113284d92ae3dea260187de7b99c374e727). Its wording can change; earlier wording is not authenticated.","canonicalUrl":"https://news.samsung.com/global/samsung-and-openai-announce-strategic-partnership-to-accelerate-advancements-in-global-ai-infrastructure","evidenceUrl":"https://news.samsung.com/global/samsung-and-openai-announce-strategic-partnership-to-accelerate-advancements-in-global-ai-infrastructure","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"Samsung Electronics (Samsung Newsroom, global), “Samsung and OpenAI Announce Strategic Partnership to Accelerate Advancements in Global AI Infrastructure”, 2025-10-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-aib-esm2-record","documentId":"aib-doc-esm2-2023","title":"Evolutionary-scale prediction of atomic-level protein structure with a language model (PubMed record)","authors":["Zeming Lin","Halil Akin","Roshan Rao","Brian Hie","Zhongkai Zhu","Wenting Lu","Nikita Smetanin","Robert Verkuil","Ori Kabeli","Yaniv Shmueli","Allan dos Santos Costa","Maryam Fazel-Zarandi","Tom Sercu","Salvatore Candido","Alexander Rives"],"publisher":"National Library of Medicine (PubMed), reproducing the Science abstract","publicationDate":"2023-03-16","version":"Retrieved for the candidate pack on 2026-10-30 (SHA-256 fb6d3954e09ed7704c21063327f72f9f7858cc845d504dbf323f845d75f525f2). PubMed record 36927031 as served on 2026-10-30, carrying the abstract, author list and dates of Science 379(6637):1123–1130; science.org refuses direct retrieval and the article is not in PMC. Its wording can change; earlier wording is not authenticated.","canonicalUrl":"https://pubmed.ncbi.nlm.nih.gov/36927031/","evidenceUrl":"https://pubmed.ncbi.nlm.nih.gov/36927031/","language":"en","accessedAt":"2026-10-30","reuse":{"attribution":"Zeming Lin, Halil Akin, Roshan Rao, Brian Hie, Zhongkai Zhu, Wenting Lu, Nikita Smetanin, Robert Verkuil, Ori Kabeli, Yaniv Shmueli, Allan dos Santos Costa, Maryam Fazel-Zarandi, Tom Sercu, Salvatore Candido, Alexander Rives, “Evolutionary-scale prediction of atomic-level protein structure with a language model (PubMed record)”, 2023-03-16.","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-people-nobel-press","documentId":"aib-doc-nobel-chemistry-2024-press-release","title":"Press release: The Nobel Prize in Chemistry 2024","authors":["The Royal Swedish Academy of Sciences (on nobelprize.org)"],"publisher":"The Royal Swedish Academy of Sciences (on nobelprize.org)","publisherId":"aib-royal-swedish-academy-of-sciences","publicationDate":"2024-10-09","version":"Retrieved for the candidate pack on 2026-10-30 (SHA-256 2f4c590c9ce9bc0d5b87c96edb465cfc77bb605a88bf781a6ae52c071516de6b). English HTML press release dated 9 October 2024, as served on 2026-10-30. Its wording can change; earlier wording is not authenticated.","canonicalUrl":"https://www.nobelprize.org/prizes/chemistry/2024/press-release/","evidenceUrl":"https://www.nobelprize.org/prizes/chemistry/2024/press-release/","language":"en","accessedAt":"2026-10-30","reuse":{"attribution":"The Royal Swedish Academy of Sciences (on nobelprize.org), “Press release: The Nobel Prize in Chemistry 2024”, 2024-10-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-aib-bray-1990-pubmed","documentId":"aib-doc-bray-1990","title":"Intracellular signalling as a parallel distributed process (PubMed record)","authors":["D. Bray"],"publisher":"National Library of Medicine (PubMed), reproducing the Journal of Theoretical Biology abstract","publicationDate":"1990-03-22","version":"PubMed record 2385105, retrieved directly at admission on 2026-10-31 (SHA-256 1e142ffd530d471ec937012c3c616420893960b67b9581fc53be1c806935fedb); the cross-family check of 2026-10-30 read the same record. It carries the abstract and the citation J Theor Biol 1990 Mar 22;143(2):215–231; the publisher’s text was not read.","canonicalUrl":"https://pubmed.ncbi.nlm.nih.gov/2385105/","evidenceUrl":"https://pubmed.ncbi.nlm.nih.gov/2385105/","language":"en","accessedAt":"2026-10-31","reuse":{"attribution":"D. Bray, “Intracellular signalling as a parallel distributed process (PubMed record)”, 1990-03-22.","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-opportunities-risks-foundation-models-2021-v1","documentId":"kp-opportunities-risks-foundation-models-2021","title":"On the Opportunities and Risks of Foundation Models","authors":["Rishi Bommasani","Drew A. Hudson","Ehsan Adeli","Russ Altman","Simran Arora","Sydney von Arx","Michael S. Bernstein","Jeannette Bohg","Antoine Bosselut","Emma Brunskill","Erik Brynjolfsson","Shyamal Buch","Dallas Card","Rodrigo Castellon","Niladri Chatterji","Annie Chen","Kathleen Creel","Chris Donahue","Moussa Doumbouya","Esin Durmus","Stefano Ermon","John Etchemendy","Kawin Ethayarajh","Chelsea Finn","Trevor Gale","Lauren Gillespie","Karan Goel","Noah Goodman","Shelby Grossman","Neel Guha","Tatsunori Hashimoto","Peter Henderson","John Hewitt","Daniel E. Ho","Jenny Hong","Kyle Hsu","Jing Huang","Thomas Icard","Saahil Jain","Dan Jurafsky","Pratyusha Kalluri","Siddharth Karamcheti","Geoff Keeling","Fereshte Khani","Omar Khattab","Pang Wei Koh","Mark Krass","Ranjay Krishna","Rohith Kuditipudi","Ananya Kumar","Faisal Ladhak","Mina Lee","Tony Lee","Jure Leskovec","Isabelle Levent","Xiang Lisa Li","Xuechen Li","Tengyu Ma","Ali Malik","Christopher D. Manning","Suvir Mirchandani","Eric Mitchell","Zanele Munyikwa","Suraj Nair","Avanika Narayan","Deepak Narayanan","Allen Nie","Juan Carlos Niebles","Hamed Nilforoshan","Julian Nyarko","Giray Ogut","Laurel Orr","Isabel Papadimitriou","Chris Piech","Eva Portelance","Christopher Potts","Aditi Raghunathan","Hongyu Ren","Frieda Rong","Yusuf Roohani","Camilo Ruiz","Jack Ryan","Christopher Ré","Dorsa Sadigh","Shiori Sagawa","Keshav Santhanam","Andy Shih","Krishnan Srinivasan","Alex Tamkin","Rohan Taori","Armin W. Thomas","Florian Tramèr","Rose E. Wang","William Wang","Bohan Wu","Jiajun Wu","Yuhuai Wu","Sang Michael Xie","Michihiro Yasunaga","Jiaxuan You","Matei Zaharia","Michael Zhang","Tianyi Zhang","Xikun Zhang","Yuhui Zhang","Lucia Zheng","Kaitlyn Zhou","Percy Liang"],"publisher":"arXiv","publicationDate":"2021-08-16","version":"arXiv:2108.07258v1, submitted 16 August 2021 (UTC). Retrieved for the candidate pack on 2026-10-28 (SHA-256 7d7de90261ec22654cd360b7925886d75321db35ab6ff9412d8893da760ffe67). The author list is the byline as printed on the first page.","versionDate":"2021-08-16","canonicalUrl":"https://arxiv.org/abs/2108.07258v1","evidenceUrl":"https://arxiv.org/pdf/2108.07258v1","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"Rishi Bommasani and others, “On the Opportunities and Risks of Foundation Models”, 2021-08-16.","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-efficientnet-rethinking-model-scaling-convolutional-2019-v1","documentId":"kp-efficientnet-rethinking-model-scaling-convolutional-2019","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","authors":["Mingxing Tan","Quoc V. Le"],"publisher":"arXiv","publicationDate":"2019-05-28","version":"arXiv:1905.11946v1, submitted 28 May 2019 (UTC). Retrieved for the candidate pack on 2026-10-28 (SHA-256 c74eb39a6142d448dc61c7ccb9afb1170f5a0509c0a02566f523ce56893bf80f). The author list is the byline as printed on the first page.","versionDate":"2019-05-28","canonicalUrl":"https://arxiv.org/abs/1905.11946v1","evidenceUrl":"https://arxiv.org/pdf/1905.11946v1","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"Mingxing Tan, Quoc V. Le, “EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks”, 2019-05-28.","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-ijcai-1977-index","documentId":"th-mark-1977-expert-systems","title":"Proceedings of the Fifth International Joint Conference on Artificial Intelligence (ijcai.org index page)","authors":["IJCAI"],"publisher":"IJCAI","publicationDate":"1977","version":"Retrieved for the candidate pack on 2026-10-29 (SHA-256 db591b1bf5610faa2dd2caba1606db068264ed069d149f3de7b41ca6e54f4115). Current proceedings index page, ijcai.org (requested as /proceedings/1977-2, served at /proceedings/1977/)","canonicalUrl":"https://ijcai.org/proceedings/1977/","evidenceUrl":"https://ijcai.org/proceedings/1977/","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"IJCAI, “Proceedings of the Fifth International Joint Conference on Artificial Intelligence (ijcai.org index page)”, 1977.","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-tencent-ar-2025","documentId":"tencent-annual-report-2025","title":"Tencent Holdings Limited Annual Report 2025","authors":["Tencent Holdings Limited"],"publisher":"Tencent Holdings Limited (tencent.com)","publicationDate":null,"version":"Undated document, retrieved on 2026-10-29 (SHA-256 2a7547168077c3d9994af673125e77612e8656bc0f17ad189371d7e4088f4e98) directly from the publisher. Version: 62d786fcf3d3c8cb7e54791ee95439ac.pdf. English-language Annual Report 2025 as served from tencent.com's financial-reports page (upload path dated 2026/04/09); the Chairman's Statement is dated 18 March 2026. The copy filed on HKEXnews was not located or compared.","canonicalUrl":"https://static.www.tencent.com/uploads/2026/04/09/62d786fcf3d3c8cb7e54791ee95439ac.pdf","evidenceUrl":"https://static.www.tencent.com/uploads/2026/04/09/62d786fcf3d3c8cb7e54791ee95439ac.pdf","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"Tencent Holdings Limited, “Tencent Holdings Limited Annual Report 2025”.","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-hunyuan-large-hf-license","documentId":"hunyuan-community-licence-large-2024","title":"Tencent-Hunyuan-Large LICENSE.txt (Tencent Hunyuan Community License Agreement)","authors":["Tencent"],"publisher":"tencent (Hugging Face), Tencent-Hunyuan-Large","publicationDate":"2025-01-19","version":"Dated document, retrieved on 2026-10-29 (SHA-256 36f4473bbeaf0508fe6e8cfd75e88b62b04d9c830f1846ea562ecb8f73e4d1f5) directly from the publisher. Version: 023bb217c7f4fdfabd7308a344994b0e9ac7359c. LICENSE.txt at the repository head revision 023bb217 (last modified 19 January 2025), read on 29 October 2026; earlier revisions were not compared.","canonicalUrl":"https://huggingface.co/tencent/Tencent-Hunyuan-Large/raw/023bb217c7f4fdfabd7308a344994b0e9ac7359c/LICENSE.txt","evidenceUrl":"https://huggingface.co/tencent/Tencent-Hunyuan-Large/raw/023bb217c7f4fdfabd7308a344994b0e9ac7359c/LICENSE.txt","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"Tencent, “Tencent-Hunyuan-Large LICENSE.txt (Tencent Hunyuan Community License Agreement)”, 2025-01-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":"c3-src-cac-deep-synthesis-batch18","title":"国家互联网信息办公室关于发布第十八批深度合成服务算法备案信息的公告","authors":["国家互联网信息办公室"],"publisher":"中央网络安全和信息化委员会办公室 / 国家互联网信息办公室 (cac.gov.cn)","publicationDate":"2026-07-17","version":"Dated page, retrieved on 2026-10-29 (SHA-256 acc92ba742ba1b4b7ae339bb2085fd02d4a7271b9a3439b4a9ce8b3903d79b9c) directly from the publisher. CAC page dated 2026-07-17 (来源: 新华社), read as it stood on 2026-10-29. Its wording can change; earlier wording is not authenticated. The cross-family check (2026-10-31) located the Internet Archive capture of 2026-08-25 linked here; a capture shows only what the archive retrieved that day. Capture of the announcement located by the cross-family check; it does not authenticate the attachment. English title (machine translation): “Announcement of the Cyberspace Administration of China publishing the eighteenth batch of information on filed deep-synthesis service algorithms”.","canonicalUrl":"https://www.cac.gov.cn/2026-07/17/c_1786032856662750.htm","evidenceUrl":"https://www.cac.gov.cn/2026-07/17/c_1786032856662750.htm","language":"zh-Hans","archivedUrl":"https://web.archive.org/web/20260825182743/https://www.cac.gov.cn/2026-07/17/c_1786032856662750.htm","archivedAt":"2026-08-25","accessedAt":"2026-10-29","reuse":{"attribution":"国家互联网信息办公室, “国家互联网信息办公室关于发布第十八批深度合成服务算法备案信息的公告”, 2026-07-17.","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-andreessen-2023-ai-will-save-the-world","documentId":"andreessen-2023-ai-will-save-the-world","title":"Why AI Will Save the World","authors":["Marc Andreessen"],"publisher":"Andreessen Horowitz (a16z.com)","publicationDate":"2023-06-06","version":"Retrieved for the candidate pack on 2026-10-29 (SHA-256 d5fd50d9724672f868bbc78e06f7b5e7fcdc899c3d6c6d8bd4484281ad10472e). Current web page, which reads \"Posted June 6, 2023\"; no revision note in the retrieved text; later edits not checked. The cross-family check retrieved it again on 2026-10-31, with the same bytes.","canonicalUrl":"https://a16z.com/ai-will-save-the-world/","evidenceUrl":"https://a16z.com/ai-will-save-the-world/","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"Marc Andreessen, “Why AI Will Save the World”, 2023-06-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":"source-rd-bengio-2023-managing-ai-risks","documentId":"bengio-2023-managing-ai-risks","title":"Managing AI Risks in an Era of Rapid Progress","authors":["Yoshua Bengio","Geoffrey Hinton","Andrew Yao","Dawn Song","Pieter Abbeel","Yuval Noah Harari","Ya-Qin Zhang","Lan Xue","Shai Shalev-Shwartz","Gillian Hadfield","Jeff Clune","Tegan Maharaj","Frank Hutter","Atılım Güneş Baydin","Sheila McIlraith","Qiqi Gao","Ashwin Acharya","David Krueger","Anca Dragan","Philip Torr","Stuart Russell","Daniel Kahneman","Jan Brauner","Sören Mindermann"],"publisher":"arXiv:2310.17688","publicationDate":"2023-10-26","version":"Retrieved for the candidate pack on 2026-10-29 (SHA-256 d6ec9c8bb5db28ea6c52aff5cfb79a7c510244a9cb71dea01f3927f8b02afcc7). arXiv v1 PDF (2310.17688v1, 26 Oct 2023), titled \"Managing AI Risks in an Era of Rapid Progress\"; a revised version was published in Science in May 2024 as \"Managing extreme AI risks amid rapid progress\" and was not compared. The cross-family check retrieved it again on 2026-10-31, with the same bytes.","canonicalUrl":"https://arxiv.org/pdf/2310.17688v1","evidenceUrl":"https://arxiv.org/pdf/2310.17688v1","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"Yoshua Bengio, Geoffrey Hinton, Andrew Yao, Dawn Song, Pieter Abbeel, Yuval Noah Harari, Ya-Qin Zhang, Lan Xue, Shai Shalev-Shwartz, Gillian Hadfield, Jeff Clune, Tegan Maharaj, Frank Hutter, Atılım Güneş Baydin, Sheila McIlraith, Qiqi Gao, Ashwin Acharya, David Krueger, Anca Dragan, Philip Torr, Stuart Russell, Daniel Kahneman, Jan Brauner, Sören Mindermann, “Managing AI Risks in an Era of Rapid Progress”, 2023-10-26.","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-bengio-2023-rogue-ais","documentId":"bengio-2023-rogue-ais","title":"How Rogue AIs may Arise","authors":["Yoshua Bengio"],"publisher":"Author's blog (yoshuabengio.org)","publicationDate":"2023-05-22","version":"Retrieved for the candidate pack on 2026-10-29 (SHA-256 d6b3b336a8264a853fb6d8e480f9445a5f48ea92e4072f39e84ca517571fff6a). Current page; its metadata gives datePublished 2023-05-22 and dateModified 2025-12-03, and the page shows no revision note, so later edits cannot be excluded. The cross-family check retrieved it again on 2026-10-31, with the same bytes. The cross-family check of 2026-10-31 found Definition 1 and Claim 2 in the capture of 23 May 2023, at the post's earlier address; it did not compare the whole page.","canonicalUrl":"https://yoshuabengio.org/en/blog/how-rogue-ais-may-arise","evidenceUrl":"https://yoshuabengio.org/en/blog/how-rogue-ais-may-arise","language":"en","archivedUrl":"https://web.archive.org/web/20230523031438/https://yoshuabengio.org/2023/05/22/how-rogue-ais-may-arise/","archivedAt":"2023-05-23","accessedAt":"2026-10-29","reuse":{"attribution":"Yoshua Bengio, “How Rogue AIs may Arise”, 2023-05-22.","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-gwern-2020-scaling-hypothesis","documentId":"gwern-2020-scaling-hypothesis","title":"The Scaling Hypothesis","authors":["Gwern Branwen"],"publisher":"Author's site (gwern.net)","publicationDate":"2020-05-28","version":"Retrieved for the candidate pack on 2026-10-29 (SHA-256 381df0d8ea0603a67f9366a2f86c8d81917abb116c538e906c5948c251e15af0). Current page, which gives its dates as \"2020-05-28–2022-01-02\"; retrieved 2026-10-29; earlier states of the page were not compared. The cross-family check retrieved it again on 2026-10-31, with the same bytes.","canonicalUrl":"https://gwern.net/scaling-hypothesis","evidenceUrl":"https://gwern.net/scaling-hypothesis","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"Gwern Branwen, “The Scaling Hypothesis”, 2020-05-28.","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-pinker-2018-popsci-fear-robots","documentId":"pinker-2018-popsci-fear-robots","title":"We’re told to fear robots. But why do we think they’ll turn on us?","authors":["Steven Pinker"],"publisher":"Popular Science (popsci.com)","publicationDate":"2018-02-14","version":"Retrieved for the candidate pack on 2026-10-29 (SHA-256 75b3508ded058bd9baedaf32ef79a899696d4fe6692a2c5a6e55de011d4a83f4). current popsci.com page, datePublished 2018-02-14 in the page metadata; the page states it is adapted from Enlightenment Now (Viking, 2018), which was not compared.","canonicalUrl":"https://www.popsci.com/robot-uprising-enlightenment-now/","evidenceUrl":"https://www.popsci.com/robot-uprising-enlightenment-now/","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"Steven Pinker, “We’re told to fear robots. But why do we think they’ll turn on us?”, 2018-02-14.","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-mccandlish-anthropic-architect-2025","claimId":"mccandlish-anthropic-architect-2025","sourceId":"source-anthropic-cto-2025","sourceRole":"primary","support":"supports","locator":"Final body paragraph, Sam McCandlish role change","passage":"Anthropic describes McCandlish as previously CTO and now Chief Architect.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-09-19","note":"Source passage independently inspected by an automated research assistant for this scoped record. Human source review pending."},{"id":"evidence-atlas-ethics-unit","claimId":"atlas-ethics-unit","sourceId":"source-atlas-deepmind-ethics","sourceRole":"primary","support":"supports","locator":"Paragraph beginning “So today we’re launching”","passage":"Ethics & Society is introduced as a new DeepMind research unit.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-09-28","note":"Original source passage checked by the machine agent that proposed the record. No independent machine audit or human source inspection is recorded for this increment."},{"id":"evidence-absent-fsf-v3-0-adoption-conditional-on-industry","claimId":"absent-fsf-v3-0-adoption-conditional-on-industry","sourceId":"source-fsf-3-0","sourceRole":"primary","support":"supports","locator":"PDF pp. 1–16, all sections, tables and footnotes","passage":"Within the inspected scope, no passage stating the provision “Adoption of protocols dependent on industry-wide adoption” was found.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-03","note":"Absence recorded by an automated research assistant on 2026-10-03. Method: Read the Overview (PDF p. 2) and the security-level paragraphs of §2.2 (PDF p. 9) and §3.2 (PDF pp. 13–14) in full; searched for “depend”, “adopt”, “across the field”, “similar protocols” and “industry”. No passage stating that Google DeepMind’s adoption of the Framework’s protocols may depend on other organisations adopting similar protocols was found; the Overview keeps a clause that certain mitigations result in effective risk mitigation for society only if all relevant organisations provide similar levels of protection. Human editorial review is pending."},{"id":"evidence-prov-fsf-v3-0-deployment-mitigation-scope","claimId":"prov-fsf-v3-0-deployment-mitigation-scope","sourceId":"source-fsf-3-0","sourceRole":"primary","support":"supports","locator":"PDF p. 7 (printed p. 7), §1.6 Summary of Risk Acceptance Criteria, misuse CCL bullet, first sub-bullet, final sentence","passage":"This is required only for external deployment, not further development.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-03","note":"Verbatim excerpt checked by an automated research assistant on 2026-10-03 against the inspected PDF, byte-identical to the Internet Archive capture of 2025-09-22. Extraction note: “This” refers to the sub-bullet's criterion that deployment mitigations have brought the risk of severe harm to an appropriate level. The ML R&D sub-bullet (same page) reads “This is required only for external deployment and large scale internal deployment, not further development.” Human editorial review is pending."},{"id":"evidence-ts-c1-michie-1968","claimId":"ts-c1-michie-1968","sourceId":"source-michie-1986-on-machine-intelligence","sourceRole":"primary","support":"supports","locator":"Chapter 20, \"Turing’s Test\", printed pp. 241–242 (PDF pages 246–247), the DOCTOR example and the explanation after it","passage":"A conversational program can appear to understand by responding to keywords with stock phrases; Michie therefore calls for a refined intelligence test instead of treating that appearance as sufficient evidence.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-06","note":"Paraphrase from the pre-1996 candidate search, whose inspection a later machine check retained; not re-read for this collection."},{"id":"evidence-yk-t15-e2","claimId":"yk-y15-extropians-1999-04-08-yudkowsky-0310-c","sourceId":"source-extropians-1999-04-08-yudkowsky-0310","sourceRole":"primary","support":"supports","locator":"message body, paragraph beginning 'The vast majority of coding would occur easily'","passage":"a \"coding drone\" would be (1) independently motivated and (2) rapidly self-enhancing … I personally believe (1) and (2).","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-07","note":"Candidate pack passage T15-e2. The quotation (19 words; trimmed 2026-10-13 from 28 words) matched the retrieved expression (SHA-256 789309c9bcf6ac523ec1a05c9a1d57411ef36b56d1a3c6cb3484fb1032a4ce48) when checked on 2026-10-07."},{"id":"evidence-yk-t16-a","claimId":"yk-y16-agi-ruin-2022-c","sourceId":"source-agi-ruin-2022","sourceRole":"primary","support":"supports","locator":"AGI Ruin: A List of Lethalities, Section B.2, item 24, second paragraph","passage":"non-hand-codable, it is unteachable on-the-first-try because the thing you are trying to teach is too weird and complicated.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-06","note":"Candidate pack passage T16-a. The quotation (18 words; trimmed 2026-10-13 from 21 words) matched the retrieved expression (SHA-256 b36f38a6fd1020bfbd7b9d941e150ea68561242f3a41a0b8f2a56b853a9a6db3) when checked on 2026-10-06. It also matched the posting-day version 1.0.0. Pack version note: edited post, current version 1.3.0; posting-day check pending."},{"id":"evidence-yk-t18-e1","claimId":"yk-y18-extropians-1999-08-25-yudkowsky-2783-c","sourceId":"source-extropians-1999-08-25-yudkowsky-2783","sourceRole":"primary","support":"supports","locator":"message body, paragraph beginning 'No, it could also be necessary'","passage":"… necessary that the SIs don't have something *else* they want to do with atoms.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-07","note":"Candidate pack passage T18-e1. The quotation (15 words) matched the retrieved expression (SHA-256 7618c597242da2ca916693d2a9f504a9f6856c06202a85912a664edca705a6ce) when checked on 2026-10-07."},{"id":"evidence-yk-t20-e1","claimId":"yk-y20-extropians-1999-08-04-yudkowsky-1591-c","sourceId":"source-extropians-1999-08-04-yudkowsky-1591","sourceRole":"primary","support":"supports","locator":"message body, paragraph beginning 'What you and I need to worry about'","passage":"worry about is the AIs getting their own ideas … and acting on those.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-07","note":"Candidate pack passage T20-e1. The quotation (14 words; trimmed 2026-10-13 from 20 words) matched the retrieved expression (SHA-256 ecb90ac102a7850f396fdd34395c0c316f7b73c3f01f97bb7acf923dd037cff4) when checked on 2026-10-07."},{"id":"evidence-eugl-non-adherents-alternative-means-1","claimId":"eugl-non-adherents-alternative-means","sourceId":"source-eu-gpai-guidelines-2025","sourceRole":"primary","support":"supports","locator":"Paragraph (92), first sentence","passage":"Providers of general-purpose AI models that do not adhere to a code of practice that is assessed as adequate are expected to demonstrate how they comply with their obligations under Chapter V of the AI Act via other adequate means","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-11","note":"Verbatim quote, matched mechanically (after whitespace normalisation) by the proposing machine agent against the text extracted from the file retrieved on 2026-10-11. Checked by fresh-context machine audit on 2026-10-11 (review/frontier-governance-2-audit-2026-10-11.md). Human editorial review is pending."},{"id":"evidence-eugl-non-adherents-alternative-means-2","claimId":"eugl-non-adherents-alternative-means","sourceId":"source-eu-gpai-guidelines-2025","sourceRole":"primary","support":"supports","locator":"Paragraph (92), third sentence","passage":"They may also be subject to a larger number of requests for information and requests for access to conduct model evaluations throughout the entire model lifecycle","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-11","note":"Verbatim quote, matched mechanically (after whitespace normalisation) by the proposing machine agent against the text extracted from the file retrieved on 2026-10-11. Checked by fresh-context machine audit on 2026-10-11 (review/frontier-governance-2-audit-2026-10-11.md). Human editorial review is pending."},{"id":"evidence-ec-g01-a","claimId":"ec-g01-hanson-economic-growth-given-machine-intelligence-a","sourceId":"source-hanson-economic-growth-given-machine-intelligence","sourceRole":"primary","support":"supports","locator":"Section 7 \"Discussion\", paragraph beginning \"These models also suggest\"","passage":"These models also suggest that wholesale use of machine intelligence could increase economic growth rates by an order of magnitude or more.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-14","note":"Candidate pack passage G01-a (research/economics-growth). The quotation (22 words) matched the checked expression (hanson-aigrow) in the pack's verification. Re-checked at admission on 2026-10-14 against a copy retrieved that day."},{"id":"evidence-ec-g01-a2","claimId":"ec-g01-hanson-economic-growth-given-machine-intelligence-a","sourceId":"source-hanson-economic-growth-given-machine-intelligence","sourceRole":"primary","support":"supports","locator":"Section 7 \"Discussion\", same paragraph, next sentence","passage":"These increased growth rates are due to our assumptions that computer technology improves faster than general technology, and that the labor population of machine intelligences could grow as fast as desired to meet labor demand.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-14","note":"Candidate pack passage G01-a2 (research/economics-growth). The quotation (35 words) matched the checked expression (hanson-aigrow) in the pack's verification. Re-checked at admission on 2026-10-14 against a copy retrieved that day."},{"id":"evidence-ec-m01-01","claimId":"ec-m01-buckingham-1955-automation-hearings-statement-b","sourceId":"source-buckingham-1955-automation-hearings-statement","sourceRole":"primary","support":"supports","locator":"printed p. 30 (prepared statement, introduction)","passage":"they can perform a series of logical operations and can choose among several previously anticipated courses of action based on built-in criteria.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-14","note":"Candidate pack passage M01-01 (research/economics-mainstream). The quotation (22 words) matched the retrieved current copy (SHA-256 3962809fbb923be62bf986addb0014ee147934a8767475c1f7cfe051959bff90) in the pack's verification. Re-checked at admission on 2026-10-14 against a copy retrieved that day."},{"id":"evidence-ec-m09-31","claimId":"ec-m09-stevenson-2019-ai-income-employment-meaning-b","sourceId":"source-stevenson-2019-ai-income-employment-meaning","sourceRole":"primary","support":"supports","locator":"pdf page 4; 7.3 What Will We Do with Ourselves? (printed p. 191)","passage":"Economists' intuition around the impact of technological change on employment comes from considering how employment has adapted following previous periods of technological change. Here, once again, economists have a united view: technological change has not historically reduced employment.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-14","note":"Candidate pack passage M09-31 (research/economics-mainstream). The quotation (38 words) matched the retrieved current copy (SHA-256 8594f8c92d1eca658f19a7b1e5ab4e41b1e08a5cf9c1c0d7489d11733e6db2b1) 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":"Stevenson reports this view via the IGM panel, then contrasts the 2017 AI question (economists divided) and argues in 7.4.1 that employment has in fact declined in the long run."}},{"id":"lg-ev-mx-meta-genai-unit-2023","claimId":"lg-mx-meta-genai-unit-2023","sourceId":"lg-src-mx-fortune-genai-2023","sourceRole":"secondary","support":"supports","locator":"Paragraph 2, quoting Zuckerberg's Instagram post","passage":"We’re creating a new top-level product group at Meta focused on generative AI","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-29","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. On 2026-10-30, by the maintainer’s decision of that day, the quotation was corrected to the archive capture of 2023-06-25 (quotation marks and apostrophes as in the capture), which a cross-family archive check read on 2026-10-29; the proposition is unchanged. The retrieval route is that of the earlier check.","retrievalRoute":"direct"},{"id":"lg-ev-deal-microsoft-inflection-agreement-hiring-cma","claimId":"lg-deal-microsoft-inflection-agreement-2024","sourceId":"lg-src-deal-cma-inflection-2024","sourceRole":"primary","support":"supports","locator":"Summary, paragraph 2","passage":"On 19 March 2024, Microsoft announced that it had hired several former Inflection employees, which the CMA understands amounted to almost all of Inflection’s team","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The quotation (25 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-deal-microsoft-inflection-agreement-licence-cma","claimId":"lg-deal-microsoft-inflection-agreement-2024","sourceId":"lg-src-deal-cma-inflection-2024","sourceRole":"primary","support":"supports","locator":"Summary, paragraph 2","passage":"Microsoft also entered into a series of arrangements with Inflection including, among others, a nonexclusive licensing deal to utilise Inflection IP in a range of ways.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The quotation (26 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-deal-microsoft-inflection-agreement-merger-cma","claimId":"lg-deal-microsoft-inflection-agreement-2024","sourceId":"lg-src-deal-cma-inflection-2024","sourceRole":"primary","support":"context","locator":"Summary, paragraph 1","passage":"is a relevant merger situation falling within the merger control jurisdiction of the CMA","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The quotation (14 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-deal-microsoft-inflection-agreement-msft","claimId":"lg-deal-microsoft-inflection-agreement-2024","sourceId":"lg-src-deal-msft-suleyman-2024","sourceRole":"primary","support":"context","locator":"Paragraph 6","passage":"Several members of the Inflection team have chosen to join Mustafa and Karén at Microsoft.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The quotation (15 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-gs-candela-openai-recruiting-2025","claimId":"lg-gs-candela-openai-recruiting-2025","sourceId":"lg-src-gs-candela-x-2025","sourceRole":"primary","support":"supports","locator":"Post text, sentence 1","passage":"Candela wrote that, in another unconventional career move, he was now the Head of Recruiting for all of OpenAI.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The paraphrase’s verbatim anchor “Head of Recruiting” 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. No human editorial review.","retrievalRoute":"x_syndication"},{"id":"evidence-ap-eliezer-yudkowsky-staring-into-the-singularity","claimId":"ap-eliezer-yudkowsky-staring-into-the-singularity","sourceId":"source-sits-2000-capture","sourceRole":"primary","support":"supports","locator":"Header copyright and “by” line beneath the title and the version number 1.2.1","passage":"Eliezer S. Yudkowsky","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Passage and locator as inspected by a reviewer from a different model family on 2026-10-27 in the Internet Archive capture of 2000-12-04; the preparer’s retrieval of 2026-10-27 had failed, so the check’s reading replaces a restatement of the source record’s author list. The credit is verified for the updated page of 2000, not for the 1996 wording. Human editorial review is pending.","retrievalRoute":"direct"},{"id":"evidence-ap-paul-christiano-christiano-2022-where-i-agree-and-disagree","claimId":"ap-paul-christiano-christiano-2022-where-i-agree-and-disagree","sourceId":"source-christiano-2022-where-i-agree-and-disagree","sourceRole":"primary","support":"supports","locator":"“by” line beneath the title (username)","passage":"paulfchristiano","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Passage and locator as inspected by a reviewer from a different model family on 2026-10-27 in a direct retrieval and the Internet Archive capture of 2022-06-19. The account was identified by an automated research assistant on 2026-10-27 through the publisher’s post data (LessWrong GraphQL API), which give this post and “What failure looks like” the same author ID. Human editorial review is pending.","retrievalRoute":"direct"},{"id":"evidence-fl-uk-gdm-mou-term-1","claimId":"fl-uk-gdm-mou-term","sourceId":"source-uk-google-deepmind-mou-2025","sourceRole":"primary","support":"supports","locator":"General terms","passage":"The MoU takes effect from the date of the last signature and will remain active for 36 months.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-28","note":"Candidate pack passage, frameworks to law (research/frameworks-to-law). The quotation (18 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 of the same address (the page’s bytes had changed). Read directly from www.gov.uk. 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-28, item 97) re-read the record’s sources and found full support. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-cpo-ch-cn-mofcom-2025-61-chips-ai-1","claimId":"cpo-ch-cn-mofcom-2025-61-chips-ai","sourceId":"source-cpo-ch-mofcom-ree-61-2025","sourceRole":"primary","support":"supports","locator":"Article 4","passage":"最终用途为研发、生产14纳米及以下逻辑芯片或者256层及以上存储芯片","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, compute, power and orbit (research/compute-power-orbit). The quotation (30 words, each CJK character counted as one) matched the text retrieved for the candidate pack on 2026-10-28 and again at admission on 2026-10-30, in a fresh retrieval (SHA-256 9fa717248dc38944358cf220f6abb02255d7cc33515cb696cf7f8c12ffb1cbb9; the bytes differ from the pack’s retrieval). Matching ignored differences of whitespace, case, quotation marks, dashes and Unicode compatibility forms, so the source’s typography can differ. Shortened at admission to keep the quotation within 50 words, each CJK character counted as one; the shortened wording is part of the matched passage. English machine translation, not verified by a person: “whose end use is the research, development or production of logic chips of 14 nm and below or memory chips of 256 layers and above”. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-cpo-ch-cn-mofcom-2025-61-chips-ai-2","claimId":"cpo-ch-cn-mofcom-2025-61-chips-ai","sourceId":"source-cpo-ch-mofcom-ree-61-2025","sourceRole":"primary","support":"supports","locator":"title","passage":"the announcement’s title describes it as a decision to implement export controls on relevant overseas rare-earth items (公布对境外相关稀土物项实施出口管制的决定).","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, compute, power and orbit (research/compute-power-orbit). The paraphrase is Selekoa’s, written from the text retrieved for the candidate pack on 2026-10-28; it is not a quotation and was not machine-matched. The cross-family check found it faithful. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-cpo-ch-cn-mofcom-2025-61-chips-ai-3","claimId":"cpo-ch-cn-mofcom-2025-61-chips-ai","sourceId":"source-cpo-ch-mofcom-suspend-70-2025","sourceRole":"primary","support":"context","locator":"operative sentence","passage":"MOFCOM–GAC Announcement No. 70 of 2025 (dated 7 November 2025) suspends MOFCOM Announcement No. 61 of 2025, among others, from that day until 10 November 2026.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, compute, power and orbit (research/compute-power-orbit). The paraphrase is Selekoa’s, written from the text retrieved for the candidate pack on 2026-10-28; it is not a quotation and was not machine-matched. The cross-family check found it faithful. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-cpo-ch-cn-mofcom-2025-61-chips-ai-4","claimId":"cpo-ch-cn-mofcom-2025-61-chips-ai","sourceId":"source-cpo-ch-mofcom-ree-61-2025","sourceRole":"primary","support":"supports","locator":"Article 4","passage":"或者研发具有潜在军事用途的人工智能的出口申请，逐案审批","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Added at the admission of the compute, power and orbit pack (research/compute-power-orbit). The end of the sentence whose opening is quoted; the middle names production and test equipment and materials for semiconductors at those processes. English machine translation, not verified by a person: “or the research and development of artificial intelligence with potential military uses, export applications are examined and approved case by case”. The quotation (26 words) matched a direct retrieval of 2026-10-30 (SHA-256 9fa717248dc38944358cf220f6abb02255d7cc33515cb696cf7f8c12ffb1cbb9). Matching ignored differences of whitespace, case, quotation marks, dashes and Unicode compatibility forms. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-cpo-ch-openai-amd-agreement-1","claimId":"cpo-ch-openai-amd-agreement","sourceId":"source-cpo-ch-openai-amd-2025","sourceRole":"primary","support":"supports","locator":"News Highlights, bullet 1","passage":"OpenAI to deploy 6 gigawatts of AMD GPUs based on a multi-year, multi-generation agreement","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, compute, power and orbit (research/compute-power-orbit). The quotation (14 words) matched the text retrieved for the candidate pack on 2026-10-28 and again at admission on 2026-10-30, in a fresh retrieval whose SHA-256 equals the pack’s. 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-29/30, item 64) answered the record’s question blind from fresh retrievals and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-cpo-ch-openai-amd-agreement-2","claimId":"cpo-ch-openai-amd-agreement","sourceId":"source-cpo-ch-openai-amd-2025","sourceRole":"primary","support":"supports","locator":"body, paragraph 1","passage":"The first 1 gigawatt deployment of AMD Instinct MI450 GPUs is set to begin in the second half of 2026.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, compute, power and orbit (research/compute-power-orbit). The quotation (20 words) matched the text retrieved for the candidate pack on 2026-10-28 and again at admission on 2026-10-30, in a fresh retrieval whose SHA-256 equals the pack’s. 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-29/30, item 64) answered the record’s question blind from fresh retrievals and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-cpo-ch-openai-amd-agreement-3","claimId":"cpo-ch-openai-amd-agreement","sourceId":"source-cpo-ch-openai-amd-2025","sourceRole":"primary","support":"supports","locator":"body, paragraph 3","passage":"Under this definitive agreement, OpenAI will work with AMD as a core strategic compute partner","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, compute, power and orbit (research/compute-power-orbit). The quotation (15 words) matched the text retrieved for the candidate pack on 2026-10-28 and again at admission on 2026-10-30, in a fresh retrieval whose SHA-256 equals the pack’s. 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-29/30, item 64) answered the record’s question blind from fresh retrievals and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-cpo-ch-samsung-openai-loi-1","claimId":"cpo-ch-samsung-openai-loi","sourceId":"source-cpo-ch-samsung-openai-2025","sourceRole":"primary","support":"supports","locator":"body, paragraph 1","passage":"the parties announcing the LOI are OpenAI, Samsung Electronics, Samsung SDS, Samsung C&T and Samsung Heavy Industries.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, compute, power and orbit (research/compute-power-orbit). The paraphrase is Selekoa’s, written from the text retrieved for the candidate pack on 2026-10-28; it is not a quotation and was not machine-matched. The cross-family check found it faithful. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-cpo-ch-samsung-openai-loi-2","claimId":"cpo-ch-samsung-openai-loi","sourceId":"source-cpo-ch-samsung-openai-2025","sourceRole":"primary","support":"supports","locator":"body, paragraph 1","passage":"today announced a letter of intent (LOI) for their strategic partnership","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, compute, power and orbit (research/compute-power-orbit). The quotation (11 words) matched the text retrieved for the candidate pack on 2026-10-28 and again at admission on 2026-10-30, in a fresh retrieval (SHA-256 f992471cf544b6ceac3d2c2f89b86113284d92ae3dea260187de7b99c374e727; the bytes differ from the pack’s retrieval). 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-cpo-ch-samsung-openai-loi-3","claimId":"cpo-ch-samsung-openai-loi","sourceId":"source-cpo-ch-samsung-openai-2025","sourceRole":"primary","support":"supports","locator":"body, paragraph 3","passage":"Samsung Electronics will work with OpenAI as a strategic memory partner to supply advanced semiconductor solutions for OpenAI’s global Stargate initiative. With OpenAI’s memory demand projected to reach up to 900,000 DRAM wafers per month","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, compute, power and orbit (research/compute-power-orbit). The quotation (35 words) matched the text retrieved for the candidate pack on 2026-10-28 and again at admission on 2026-10-30, in a fresh retrieval (SHA-256 f992471cf544b6ceac3d2c2f89b86113284d92ae3dea260187de7b99c374e727; the bytes differ from the pack’s retrieval). 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-cpo-ch-samsung-openai-loi-4","claimId":"cpo-ch-samsung-openai-loi","sourceId":"source-cpo-ch-samsung-openai-2025","sourceRole":"primary","support":"context","locator":"body, paragraph 3","passage":"the release says Samsung will contribute toward meeting OpenAI's projected memory need with its DRAM solutions.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, compute, power and orbit (research/compute-power-orbit). The paraphrase is Selekoa’s, written from the text retrieved for the candidate pack on 2026-10-28; it is not a quotation and was not machine-matched. The cross-family check found it faithful. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-aib-mod-esm2-metagenomic-atlas-1","claimId":"aib-mod-esm2-metagenomic-atlas","sourceId":"source-aib-esm2-record","sourceRole":"primary","support":"supports","locator":"abstract as reproduced in the PubMed record","passage":"We apply this capability to construct the ESM Metagenomic Atlas by predicting structures for >617 million metagenomic protein sequences, including >225 million that are predicted with high confidence","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, AI in biology (research/ai-in-biology). The quotation (28 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. Abstract text relayed by the PubMed record (PMID 36927031): the authors' own text, so primary; the journal expression was not read. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-aib-ppl-nobel-press-published-1","claimId":"aib-ppl-nobel-press-published","sourceId":"source-aib-people-nobel-press","sourceRole":"primary","support":"supports","locator":"date line and opening sentence","passage":"The release is dated 9 October 2024 and opens with the Academy's statement that it has decided to award the Nobel Prize in Chemistry 2024.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, AI in biology (research/ai-in-biology). The paraphrase is Selekoa’s, written from the text retrieved for the candidate pack on 2026-10-30; it is not a quotation and was not machine-matched. A cross-family machine check (2026-10-30, item A46) answered the record’s question blind from fresh retrievals and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-aib-arg-p2-bray-1990-1","claimId":"aib-arg-p2-bray-1990","sourceId":"source-aib-bray-1990-pubmed","sourceRole":"primary","support":"supports","locator":"Abstract, third sentence (PubMed record)","passage":"Using the response of hepatocytes to glucagon as an example, a procedure is described by which a PDP network could simulate a cell signalling pathway.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Added at the admission of the AI in biology pack (research/ai-in-biology). Located by the cross-family machine check of 2026-10-30 (item A55 for P2, A56 for P3) and adopted as earliest located by the maintainer’s decision of 2026-10-30. The abstract relayed by PubMed is the author’s own text. The quotation (25 words) matched a direct retrieval of 2026-10-31 (SHA-256 1e142ffd530d471ec937012c3c616420893960b67b9581fc53be1c806935fedb). Matching ignored differences of whitespace, case, quotation marks and dashes. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-aib-arg-p2-bray-1990-2","claimId":"aib-arg-p2-bray-1990","sourceId":"source-aib-bray-1990-pubmed","sourceRole":"primary","support":"supports","locator":"Abstract, last sentence (PubMed record)","passage":"The analogy with PDP networks shows how living cells can recognize combinations of environmental influences, how cell responses can be stabilized and made resistant to damage, and how novel cell signalling pathways might appear during evolution.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Added at the admission of the AI in biology pack (research/ai-in-biology). Located by the cross-family machine check of 2026-10-30 (item A55 for P2, A56 for P3) and adopted as earliest located by the maintainer’s decision of 2026-10-30. The abstract relayed by PubMed is the author’s own text. The quotation (36 words) matched a direct retrieval of 2026-10-31 (SHA-256 1e142ffd530d471ec937012c3c616420893960b67b9581fc53be1c806935fedb). Matching ignored differences of whitespace, case, quotation marks and dashes. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-kp-states-efficientnet-rethinking-model-scaling-convolutional-2019-2-1","claimId":"kp-states-efficientnet-rethinking-model-scaling-convolutional-2019-2","sourceId":"source-kp-efficientnet-rethinking-model-scaling-convolutional-2019-v1","sourceRole":"primary","support":"supports","locator":"arXiv v1, PDF p. 1, abstract","passage":"To go even further, we use neural architecture search to design a new baseline network and scale it up to obtain a family of models, called EfficientNets, which achieve much better accuracy and efficiency than previous ConvNets.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, key papers (research/key-papers). The quotation (37 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-scaling-laws-bert-pre-training-deep-bidirectional-2019-1","claimId":"kp-cites-scaling-laws-bert-pre-training-deep-bidirectional-2019","sourceId":"source-scaling-laws-v1-2020","sourceRole":"primary","support":"supports","locator":"PDF p. 28, reference by arXiv identifier","passage":"The text gives the arXiv identifier 1810.04805.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, key papers (research/key-papers). The citation was matched (arXiv identifier) 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-kimi-k3-report-switch-transformers-scaling-trillion-parameter-2021-1","claimId":"kp-cites-kimi-k3-report-switch-transformers-scaling-trillion-parameter-2021","sourceId":"c2-src-kimi-k3-report","sourceRole":"primary","support":"supports","locator":"PDF p. 36, 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-ernie-3-report-zero-memory-optimizations-toward-training-2019-1","claimId":"kp-cites-ernie-3-report-zero-memory-optimizations-toward-training-2019","sourceId":"c2-src-ernie3-arxiv-v1","sourceRole":"primary","support":"supports","locator":"PDF p. 20, 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-llama-paper-decoupled-weight-decay-regularization-2017-1","claimId":"kp-cites-llama-paper-decoupled-weight-decay-regularization-2017","sourceId":"source-xm-llama-paper","sourceRole":"primary","support":"supports","locator":"reference by arXiv identifier","passage":"The text gives the arXiv identifier 1711.05101.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, key papers (research/key-papers). The citation was matched (arXiv identifier) 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 B069) found the citation in the citing text. No human editorial review."},{"id":"evidence-kp-cites-iem-2013-hanson-economic-growth-given-machine-intelligence-1","claimId":"kp-cites-iem-2013-hanson-economic-growth-given-machine-intelligence","sourceId":"source-iem","sourceRole":"primary","support":"supports","locator":"PDF p. 4, 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-hongyu-ren-opportunities-risks-foundation-models-2021-1","claimId":"kp-authored-hongyu-ren-opportunities-risks-foundation-models-2021","sourceId":"source-kp-opportunities-risks-foundation-models-2021-v1","sourceRole":"primary","support":"supports","locator":"PDF p. 1, byline","passage":"Hongyu Ren","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-yi-tay-palm-scaling-language-modeling-pathways-2022-1","claimId":"kp-authored-yi-tay-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":"Yi Tay","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-sym-name-mark-1977-1","claimId":"th-sym-name-mark-1977","sourceId":"source-th-a-ijcai-1977-index","sourceRole":"primary","support":"supports","locator":"proceedings index page, entry","passage":"The Reformulation Approach to Building Expert Systems William S. Mark Pages 329–334","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, Kinds of AI and technical history (research/technical-history). The quotation (12 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":"c3-ev-tencent-large-licence-no-improve","claimId":"c3-tencent-large-licence-no-improve","sourceId":"c3-src-hunyuan-large-hf-license","sourceRole":"primary","support":"supports","locator":"Section 5(b)","passage":"You must not use the Tencent Hunyuan Works or any Output or results of the Tencent Hunyuan Works to improve any other large language model (other than Tencent Hunyuan or Model Derivatives thereof).","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 (33 words) 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. No human editorial review.","retrievalRoute":"direct"},{"id":"c3-ev-tencent-legal-form-2025","claimId":"c3-tencent-legal-form-2025","sourceId":"c3-src-tencent-ar-2025","sourceRole":"primary","support":"supports","locator":"Definition, entry “Company” (printed p. 274; PDF p. 275)","passage":"Tencent Holdings Limited, a limited liability company organised and existing under the laws of the Cayman Islands and the shares of which are listed on the Stock Exchange","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 (28 words) 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. Locator corrected at admission (K099). A cross-family machine check (2026-10-31, item K099) answered the record’s question blind from fresh retrievals and agreed in part; the admission record lists how each point was handled. No human editorial review.","retrievalRoute":"direct"},{"id":"c3-ev-tencent-legal-form-2025-cover","claimId":"c3-tencent-legal-form-2025","sourceId":"c3-src-tencent-ar-2025","sourceRole":"primary","support":"supports","locator":"Cover","passage":"Incorporated in the Cayman Islands with limited liability","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 (8 words) 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. A cross-family machine check (2026-10-31, item K099) answered the record’s question blind from fresh retrievals and agreed in part; the admission record lists how each point was handled. No human editorial review.","retrievalRoute":"direct"},{"id":"c3-ev-governance-cac-deep-synthesis-list-2026-07-count-1","claimId":"c3-governance-cac-deep-synthesis-list-2026-07-count","sourceId":"c3-src-cac-deep-synthesis-batch18","sourceRole":"primary","support":"supports","locator":"Attachment line; count from the attached .docx table","passage":"The attached list (境内深度合成服务算法备案清单（2026年7月）) is a table with the columns 序号, 算法名称, 角色, 主体名称, 应用产品, 主要用途, 备案编号, 备注; its rows are numbered 1 to 706 (599 服务提供者, 107 服务技术支持者), counted by the preparer.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, Chinese frontier-AI institutions, third collection (research/china-labs-3). The paraphrase’s verbatim anchor 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. The paraphrase is Selekoa’s; only the anchor is the source’s wording. English machine translation, not verified by a person: “Attachment: List of filed domestic deep-synthesis service algorithms (2026-07)”. A cross-family machine check (2026-10-31, item K109) answered the record’s question blind from fresh retrievals and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-rd-r02-andreessen-2023-ai-will-save-the-world-1","claimId":"rd-r02-andreessen-2023-ai-will-save-the-world","sourceId":"source-rd-andreessen-2023-ai-will-save-the-world","sourceRole":"primary","support":"supports","locator":"Section \"AI Risk #1: Will AI Kill Us All?\"","passage":"In short, AI doesn’t want, it doesn’t have goals, it doesn’t want to kill you, because it’s not alive.","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 (19 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 71) re-read the record’s source and found the quotation and stance supported. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-rd-r06-pinker-2018-popsci-fear-robots-1","claimId":"rd-r06-pinker-2018-popsci-fear-robots","sourceId":"source-rd-pinker-2018-popsci-fear-robots","sourceRole":"primary","support":"supports","locator":"Section on the Value Alignment Problem","passage":"The ability to choose an action that best satisfies conflicting goals is not an add-on to intelligence that engineers might slap themselves in the forehead for forgetting to install; it is intelligence. So is the ability to interpret the intentions of a language user in context.","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 (46 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"},{"id":"evidence-rd-r06-pinker-2018-popsci-fear-robots-2","claimId":"rd-r06-pinker-2018-popsci-fear-robots","sourceId":"source-rd-pinker-2018-popsci-fear-robots","sourceRole":"primary","support":"supports","locator":"Section on the Value Alignment Problem, after the Get Smart example","passage":"It is developed incrementally, designed to satisfy multiple conditions, tested before it is implemented, and constantly tweaked for efficacy and safety.","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 (21 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"},{"id":"evidence-rd-r08-bengio-2023-managing-ai-risks-1","claimId":"rd-r08-bengio-2023-managing-ai-risks","sourceId":"source-rd-bengio-2023-managing-ai-risks","sourceRole":"primary","support":"supports","locator":"Section \"Societal-scale risks\", PDF p. 2","passage":"Once autonomous AI systems pursue undesirable goals, embedded by malicious actors or by accident, we may be unable to keep them in check.","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 (23 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"},{"id":"evidence-rd-r08-bengio-2023-managing-ai-risks-2","claimId":"rd-r08-bengio-2023-managing-ai-risks","sourceId":"source-rd-bengio-2023-managing-ai-risks","sourceRole":"primary","support":"supports","locator":"PDF p. 3","passage":"Without sufficient caution, we may irreversibly lose control of autonomous AI systems, rendering human intervention ineffective.","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 (16 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"},{"id":"evidence-rd-r08-bengio-2023-managing-ai-risks-3","claimId":"rd-r08-bengio-2023-managing-ai-risks","sourceId":"source-rd-bengio-2023-managing-ai-risks","sourceRole":"primary","support":"supports","locator":"PDF p. 3","passage":"This unchecked AI advancement could culminate in a large-scale loss of life and the biosphere, and the marginalization or even extinction of humanity.","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 (23 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"},{"id":"evidence-rd-r08-bengio-2023-rogue-ais-1","claimId":"rd-r08-bengio-2023-rogue-ais","sourceId":"source-rd-bengio-2023-rogue-ais","sourceRole":"primary","support":"supports","locator":"Definition 1","passage":"A potentially rogue AI is an autonomous AI system that could behave in ways that would be catastrophically harmful to a large fraction of humans, potentially endangering our societies and even our species or the biosphere.","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 (36 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 111) re-read the record’s source and found the quotation and stance supported. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-rd-r08-bengio-2023-rogue-ais-2","claimId":"rd-r08-bengio-2023-rogue-ais","sourceId":"source-rd-bengio-2023-rogue-ais","sourceRole":"primary","support":"supports","locator":"Claim 2","passage":"A superintelligent AI system that is autonomous and goal-directed would be a potentially rogue AI if its goals do not strictly include the well-being of humanity and the biosphere","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 (29 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 111) re-read the record’s source and found the quotation and stance supported. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-rd-r13-gwern-2020-scaling-hypothesis-1","claimId":"rd-r13-gwern-2020-scaling-hypothesis","sourceId":"source-rd-gwern-2020-scaling-hypothesis","sourceRole":"primary","support":"supports","locator":"Section \"Scaling Hypothesis\"","passage":"The scaling hypothesis regards the blessings of scale as the secret of AGI: intelligence is ‘just’ simple neural units & learning algorithms applied to diverse experiences at a (currently) unreachable scale.","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 (30 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,1,4,9,19,22,23,50,51,52,73,85,106,139,157,165,235,245,265,294,333,334,347,364,365,367,369,388,403,404,496,504,513,522,524,551,566,683,703,740,809,832,947,970,1034,1083,1131,1342,1361,1399,1415,1439,1450,1456,1462,1465,1484,1497,1525,1643,1663,1722,1762,1776,1781,1793,1794,1808,1836,1852,1865,1899],"claims":[165,305,494,555,794,1090,1091,1111,1127,1222,1241,1294,1470,1636,1679,1767,2349,2479,3040,3058,3210,3215,3619,3679,3744,3870,3971,4162,4179,4303,4312,4537,4647,4858,5004,5065,5080,5144,5188,5214,5218,5268],"sources":[10,46,74,83,135,152,265,295,338,339,355,370,371,463,475,504,519,593,600,655,702,781,799,869,917,918,947,950,1190,1196,1237,1273,1370,1449,1564,1576,1629,1669,1700,1710,1711,1745,1796],"evidence":[184,326,525,622,1004,1326,1327,1350,1369,1514,1515,1553,1554,1622,1836,2064,2116,2117,2118,2119,2273,2996,3126,3948,3994,3995,3996,3997,4365,4366,4367,4378,4379,4380,4381,5004,5087,5200,5201,5328,5429,5620,5637,5761,5770,5995,6105,6363,6599,6692,6693,6720,6824,6908,6909,6955,6956,6957,6963,6964,7047]},"version":"131evrz"}