{"index":{"byClaim":[["issued-fsf-3-0",["documents:frontier-safety-frameworks","guide:frontier-frameworks-and-law"]],["prov-ms-fgf-2026-low-medium-deployment",["documents:frontier-safety-frameworks"]],["sb-civil-penalty-cap",["commitments:external-commitments","guide:frontier-frameworks-and-law"]],["ts-a3-good-1965-context",["propositions:superintelligence"]],["yk-y22-time-2023-shut-it-all-down-c",["propositions:yudkowsky-arguments"]],["cn-genai-measures-security-assessment",["guide:frontier-frameworks-and-law"]],["ec-m07-furman-2019-automation-future-past-b",["propositions:economics-of-machine-intelligence"]],["ec-e02-restrepo-2025-we-wont-be-missed-b",["propositions:economics-of-machine-intelligence"]],["lg-oai-ilya-sutskever-nonprofit-board-2019",["control:openai"]],["cmp-fsf-v2-0-d3-halt",["compare:frontier-safety-frameworks"]],["cmp-fsf-v3-0-d4-oversight",["compare:frontier-safety-frameworks"]],["cmp-rsp-v3-3-d7-external",["compare:frontier-safety-frameworks"]],["cmp-preparedness-beta-2023-d1-cbrn",["compare:frontier-safety-frameworks"]],["cmp-faif-2025-d1-other",["compare:frontier-safety-frameworks"]],["cmp-ms-fgf-2026-d1-cyber",["compare:frontier-safety-frameworks"]],["cmp-meta-faf-v1-1-d7-external",["compare:frontier-safety-frameworks"]],["aib-arg-p4-esm3-2024",["propositions:ai-in-science"]]],"marks":[["good-1965",[{"collectionId":"superintelligence","propositionId":"intelligence-explosion","claimId":"ts-a1-good-1965","text":"Earliest located in Propositions about superintelligence, 1863–2022 for A1 Intelligence explosion"},{"collectionId":"superintelligence","propositionId":"intelligence-explosion","claimId":"ts-a1-good-1965","text":"Earliest located use of the name “intelligence explosion” in Propositions about superintelligence, 1863–2022 for A1 Intelligence explosion"},{"collectionId":"superintelligence","propositionId":"ai-automated-ai-research","claimId":"ts-a5-good-1965","text":"Earliest located in Propositions about superintelligence, 1863–2022 for A5 AI-automated AI research"}]],["aghion-jones-jones-2017-ai-and-economic-growth",[{"collectionId":"economics-of-machine-intelligence","propositionId":"accelerating-growth-from-automated-research","claimId":"ec-g02-aghion-jones-jones-2017-ai-and-economic-growth-a","text":"Earliest located in tier 1 of Economics of machine intelligence for G02 Automated research produces accelerating growth"},{"collectionId":"economics-of-machine-intelligence","propositionId":"accelerating-growth-from-automated-research","claimId":"ec-g02-aghion-jones-jones-2017-ai-and-economic-growth-c","text":"Earliest located tier-1 text contesting G02 Automated research produces accelerating growth in Economics of machine intelligence"},{"collectionId":"economics-of-machine-intelligence","propositionId":"other-constraints-prevent-explosive-growth","claimId":"ec-g05-aghion-jones-jones-2017-ai-and-economic-growth-a","text":"Earliest located in tier 1 of Economics of machine intelligence for G05 Other constraints prevent explosive growth"},{"collectionId":"economics-of-machine-intelligence","propositionId":"ai-improving-ai-accelerates-capability","claimId":"ec-e01-aghion-jones-jones-2017-ai-and-economic-growth-a","text":"Earliest located in tier 1 of Economics of machine intelligence for E01 Machine intelligence improving itself accelerates its capability growth"},{"collectionId":"economics-of-machine-intelligence","propositionId":"ai-improving-ai-accelerates-capability","claimId":"ec-e01-aghion-jones-jones-2017-ai-and-economic-growth-c","text":"Earliest located tier-1 text contesting E01 Machine intelligence improving itself accelerates its capability growth in Economics of machine intelligence"}]]],"chronicle":{"years":[{"year":1863,"topics":{"ideas":5},"stated":0},{"year":1865,"topics":{"ideas":1},"stated":0},{"year":1872,"topics":{"ideas":7},"stated":0},{"year":1943,"topics":{"ideas":1},"stated":0},{"year":1947,"topics":{"ideas":2},"stated":0},{"year":1950,"topics":{"ideas":7},"stated":0},{"year":1951,"topics":{"ideas":5},"stated":0},{"year":1952,"topics":{"ideas":2},"stated":0},{"year":1955,"topics":{"ideas":31},"stated":0},{"year":1956,"topics":{"ideas":1},"stated":0},{"year":1957,"topics":{"ideas":1},"stated":0},{"year":1958,"topics":{"ideas":3},"stated":0},{"year":1959,"topics":{"ideas":6},"stated":0},{"year":1960,"topics":{"ideas":11},"stated":0},{"year":1961,"topics":{"ideas":10},"stated":0},{"year":1965,"topics":{"ideas":8},"stated":0},{"year":1966,"topics":{"ideas":20},"stated":0},{"year":1968,"topics":{"ideas":5},"stated":0},{"year":1969,"topics":{"ideas":2},"stated":0},{"year":1971,"topics":{"ideas":4},"stated":0},{"year":1972,"topics":{"ideas":1},"stated":0},{"year":1973,"topics":{"ideas":2},"stated":0},{"year":1974,"topics":{"ideas":2},"stated":0},{"year":1975,"topics":{"ideas":1},"stated":0},{"year":1976,"topics":{"ideas":1},"stated":0},{"year":1977,"topics":{"people":2,"ideas":8},"stated":0},{"year":1979,"topics":{"ideas":4},"stated":0},{"year":1980,"topics":{"ideas":2},"stated":0},{"year":1981,"topics":{"people":2},"stated":0},{"year":1982,"topics":{"ideas":4},"stated":0},{"year":1983,"topics":{"ideas":4},"stated":0},{"year":1984,"topics":{"ideas":21},"stated":0},{"year":1985,"topics":{"ideas":9},"stated":0},{"year":1986,"topics":{"ideas":18},"stated":0},{"year":1987,"topics":{"ideas":1},"stated":0},{"year":1988,"topics":{"ideas":6},"stated":0},{"year":1989,"topics":{"ideas":8},"stated":0},{"year":1990,"topics":{"ideas":5},"stated":0},{"year":1991,"topics":{"ideas":11},"stated":0},{"year":1992,"topics":{"ideas":9},"stated":0},{"year":1993,"topics":{"ideas":14,"people":3},"stated":0},{"year":1994,"topics":{"ideas":14},"stated":0},{"year":1995,"topics":{"ideas":10,"people":1},"stated":0},{"year":1996,"topics":{"ideas":71},"stated":0},{"year":1997,"topics":{"ideas":12},"stated":0},{"year":1998,"topics":{"ideas":49},"stated":0},{"year":1999,"topics":{"ideas":27,"people":1,"institutions":1},"stated":0},{"year":2000,"topics":{"ideas":62},"stated":0},{"year":2001,"topics":{"ideas":39},"stated":0},{"year":2002,"topics":{"ideas":30},"stated":0},{"year":2003,"topics":{"ideas":8},"stated":0},{"year":2004,"topics":{"ideas":12,"people":3},"stated":0},{"year":2005,"topics":{"ideas":10,"people":1},"stated":0},{"year":2006,"topics":{"ideas":26,"people":1},"stated":0},{"year":2007,"topics":{"ideas":20},"stated":0},{"year":2008,"topics":{"ideas":57,"people":3,"institutions":1},"stated":0},{"year":2009,"topics":{"ideas":10,"people":1},"stated":0},{"year":2010,"topics":{"people":3,"ideas":11,"institutions":1,"governance":4},"stated":0},{"year":2011,"topics":{"people":3,"ideas":7,"institutions":2},"stated":0},{"year":2012,"topics":{"people":4,"ideas":17,"institutions":2},"stated":0},{"year":2013,"topics":{"ideas":46,"people":4,"institutions":2,"capital":1},"stated":0},{"year":2014,"topics":{"institutions":2,"ideas":54,"people":5},"stated":0},{"year":2015,"topics":{"people":22,"ideas":122,"institutions":3,"capital":1},"stated":0},{"year":2016,"topics":{"ideas":88,"people":2},"stated":0},{"year":2017,"topics":{"people":16,"institutions":2,"ideas":128,"governance":2},"stated":0},{"year":2018,"topics":{"people":8,"ideas":158,"institutions":8,"governance":1},"stated":0},{"year":2019,"topics":{"capital":1,"compute":1,"people":10,"governance":19,"ideas":175,"institutions":4},"stated":0},{"year":2020,"topics":{"people":6,"ideas":98,"institutions":1,"governance":2},"stated":0},{"year":2021,"topics":{"people":27,"ideas":177,"compute":1,"institutions":23,"governance":4,"capital":6},"stated":0},{"year":2022,"topics":{"people":15,"ideas":217,"institutions":6,"governance":3,"compute":2,"capital":1},"stated":0},{"year":2023,"topics":{"capital":5,"compute":7,"institutions":23,"people":51,"governance":179,"ideas":389},"stated":0},{"year":2024,"topics":{"capital":12,"compute":19,"governance":282,"people":80,"ideas":178,"institutions":28},"stated":1},{"year":2025,"topics":{"governance":547,"compute":69,"capital":34,"people":90,"institutions":18,"ideas":178},"stated":7},{"year":2026,"topics":{"governance":442,"capital":8,"compute":32,"institutions":21,"ideas":91,"people":107},"stated":19},{"year":2027,"topics":{},"stated":9},{"year":2028,"topics":{},"stated":6},{"year":2029,"topics":{},"stated":3},{"year":2030,"topics":{},"stated":3},{"year":2032,"topics":{},"stated":2},{"year":2035,"topics":{},"stated":2},{"year":2039,"topics":{},"stated":1},{"year":2042,"topics":{},"stated":1},{"year":2050,"topics":{},"stated":1}],"scheduled":[],"statedBy":[]},"collections":[{"target":{"kind":"propositions","id":"superintelligence"},"title":"Propositions about superintelligence, 1863–2022","claimIds":["ts-a3-good-1965-context"],"records":[]},{"target":{"kind":"propositions","id":"risk-debate"},"title":"Arguments about catastrophic risk from advanced AI","claimIds":[],"records":[]},{"target":{"kind":"propositions","id":"yudkowsky-arguments"},"title":"Eliezer Yudkowsky’s arguments on common claims about AI, 1996–2026","claimIds":["yk-y22-time-2023-shut-it-all-down-c"],"records":[]},{"target":{"kind":"propositions","id":"economics-of-machine-intelligence"},"title":"Economics of machine intelligence","claimIds":["ec-m07-furman-2019-automation-future-past-b","ec-e02-restrepo-2025-we-wont-be-missed-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-p4-esm3-2024"],"records":[]},{"target":{"kind":"documents"},"title":"Frontier safety frameworks","claimIds":["issued-fsf-3-0","prov-ms-fgf-2026-low-medium-deployment"]},{"target":{"kind":"compare","id":"frontier-safety-frameworks"},"title":"Compare frameworks","claimIds":["cmp-fsf-v2-0-d3-halt","cmp-fsf-v3-0-d4-oversight","cmp-rsp-v3-3-d7-external","cmp-preparedness-beta-2023-d1-cbrn","cmp-faif-2025-d1-other","cmp-ms-fgf-2026-d1-cyber","cmp-meta-faf-v1-1-d7-external"]},{"target":{"kind":"control","id":"openai"},"title":"OpenAI’s control structure, 2015–2026","claimIds":["lg-oai-ilya-sutskever-nonprofit-board-2019"]},{"target":{"kind":"control","id":"anthropic"},"title":"Anthropic’s control structure, 2021–2026","claimIds":[]},{"target":{"kind":"commitments"},"title":"External commitments and obligations","claimIds":["sb-civil-penalty-cap"]},{"target":{"kind":"question","id":"frameworks-to-obligations"},"title":"Frameworks, commitments and legal obligations, 2023–2026","claimIds":["issued-fsf-3-0","sb-civil-penalty-cap","cn-genai-measures-security-assessment"]},{"target":{"kind":"reading"},"title":"Founding and early leadership","claimIds":[]}]},"entities":[{"id":"openai","name":"OpenAI","type":"organisation"},{"id":"google-deepmind","name":"Google DeepMind","type":"organisation"},{"id":"google-brain","name":"Google Brain","type":"organisation"},{"id":"ilya-sutskever","name":"Ilya Sutskever","type":"person"},{"id":"rsp-2023","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v1.0","publisherId":"anthropic","publishedAt":"2023-09-19","effectiveAt":"2023-09-19","dateNote":"Initial public policy dated September 19, 2023; original entity and publication claim retained."}},{"id":"fsf-2024","type":"document","documentVersion":{"family":"deepmind-fsf","label":"v1.0","publisherId":"google-deepmind","publishedAt":"2024-05-17","dateNote":"The sourced publication date does not establish an implementation or effective date."}},{"id":"good-1965","name":"Speculations Concerning the First Ultraintelligent Machine","type":"document"},{"id":"jeff-dean","name":"Jeff Dean","type":"person"},{"id":"google","name":"Google","type":"organisation"},{"id":"rsp-v2-0","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v2.0","publisherId":"anthropic","effectiveAt":"2024-10-15","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"rsp-v2-1","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v2.1","publisherId":"anthropic","effectiveAt":"2025-03-31","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"rsp-v2-2","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v2.2","publisherId":"anthropic","effectiveAt":"2025-05-14","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"rsp-v3-0","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v3.0","publisherId":"anthropic","publishedAt":"2026-02-24","effectiveAt":"2026-02-24","dateNote":"The cover effective date and release announcement publication date both identify February 24, 2026."}},{"id":"rsp-v3-1","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v3.1","publisherId":"anthropic","effectiveAt":"2026-04-02","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"rsp-v3-2","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v3.2","publisherId":"anthropic","effectiveAt":"2026-04-29","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"rsp-v3-3","name":"Anthropic Responsible Scaling Policy — v3.3","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v3.3","publisherId":"anthropic","effectiveAt":"2026-05-26","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"rsp-v3-4","type":"document","documentVersion":{"family":"anthropic-rsp","label":"v3.4","publisherId":"anthropic","effectiveAt":"2026-07-08","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"fsf-v2-0","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."},"name":"Google DeepMind Frontier Safety Framework — v2.0"},{"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":"preparedness-beta-2023","name":"OpenAI Preparedness Framework — Beta","type":"document","documentVersion":{"family":"openai-preparedness","label":"Beta","publisherId":"openai","publishedAt":"2023-12-18","dateNote":"The sourced publication date does not establish an implementation or effective date."}},{"id":"preparedness-v2","type":"document","documentVersion":{"family":"openai-preparedness","label":"Version 2","publisherId":"openai","publishedAt":"2025-04-15","revisedAt":"2025-04-15","dateNote":"Cover last-updated date and dated publication announcement both identify April 15, 2025; no distinct effective date is asserted."}},{"id":"faif-2025","name":"xAI Frontier Artificial Intelligence Framework — December 2025 edition","type":"document","documentVersion":{"family":"xai-faif","label":"December 2025 edition","publisherId":"xai","revisedAt":"2025-12-30","dateNote":"The printed update date is retained; it is not silently treated as publication. The URL filename says December 31; the visible document says last updated December 30."}},{"id":"faif-2026","type":"document","documentVersion":{"family":"xai-faif","label":"June 2026 edition","publisherId":"xai","effectiveAt":"2026-06-30","dateNote":"The stated effective date is retained; a separate publication day is not inferred."}},{"id":"greg-brockman","name":"Greg Brockman","type":"person"},{"id":"human-preferences-paper","name":"Deep reinforcement learning from human preferences","type":"document"},{"id":"amplification-paper","name":"Supervising strong learners by amplifying weak experts","type":"document"},{"id":"weak-strong-paper","name":"Weak-to-Strong Generalization: Eliciting Strong Capabilities With Weak Supervision","type":"document"},{"id":"miri-ml-agenda","name":"Alignment for Advanced Machine Learning Systems","type":"document"},{"id":"christian-szegedy","name":"Christian Szegedy","type":"person"},{"id":"zhipu","name":"Zhipu AI / 智谱","type":"organisation"},{"id":"meta-faf-v1-1","name":"Meta Frontier AI Framework — Version 1.1","type":"document","documentVersion":{"family":"meta-frontier-ai","label":"v1.1","publisherId":"meta","publishedAt":"2025-02-03","dateNote":"Publication date from Meta’s dated announcement of February 3, 2025; Meta’s v2 change log also dates the initial version February 3, 2025. The earliest archive capture of the file is 2025-02-13; a revised expression under the same label followed by 2025-03-28."}},{"id":"meta-aasf-v2-0","type":"document","documentVersion":{"family":"meta-frontier-ai","label":"v2.0","publisherId":"meta","publishedAt":"2026-04-08","dateNote":"Publication date from Meta’s dated announcement of April 8, 2026; the framework’s own change log dates the version April 7, 2026."}},{"id":"ms-fgf-2025","type":"document","documentVersion":{"family":"microsoft-frontier-governance","label":"Feb 2025 (Version 1)","publisherId":"microsoft","publishedAt":"2025-02","dateNote":"Page footers read “Version 1 (February 2025)” and the change log dates the first version 8 February 2025. No separate dated announcement was located; the earliest archive capture is 2025-02-26, so publication is dated only to the month."}},{"id":"ms-fgf-2026","name":"Microsoft Frontier Governance Framework — February 2026","type":"document","documentVersion":{"family":"microsoft-frontier-governance","label":"Feb 2026","publisherId":"microsoft","revisedAt":"2026-02","dateNote":"The edition’s footers and change log date it February 2026. A publication date is not established: the file was last modified 2026-03-24 and first captured 2026-04-24."}},{"id":"california-sb-53","name":"California SB 53 (2025): Transparency in Frontier Artificial Intelligence Act, as chaptered","type":"document","documentVersion":{"family":"ca-sb-53","label":"Chaptered (Stats. 2025, ch. 138)","publisherId":"california-legislature","publishedAt":"2025-09-29","effectiveAt":"2026-01-01","dateNote":"Approved by the Governor and filed with the Secretary of State on 2025-09-29 (chaptered header and bill history); the chaptered text page reads “Date Published: 09/29/2025 09:00 PM”. The added code sections took effect on 2026-01-01 according to the codified history notes checked on 2026-10-04, which showed no amendment. Gov. Code § 11546.8 is operative only on an appropriation."}},{"id":"openai-inc","name":"OpenAI, Inc. (OpenAI Foundation)","type":"organisation"},{"id":"minimax","name":"MiniMax","type":"organisation"},{"id":"hanson-2008-what-core-argument","name":"What Core Argument?","type":"document"},{"id":"recursive-self-improvement","name":"Recursive self-improvement","type":"concept","proposition":{"code":"A3","criterion":"A system improves its own capacity to improve itself, so that each improvement feeds the next (self-augmentation, self-enhancement). Learning from experience or teaching alone does not meet the criterion, and neither does building a better successor, or adding machines to a population, unless the same system is improved.","terms":["recursive self-improvement"]}},{"id":"build-superintelligence-fast","name":"Build superintelligence as fast as possible","type":"concept","proposition":{"code":"Y22","criterion":"An explicit claim that superintelligence should be reached as fast as possible because its arrival will be good, on the premise that reaching superintelligence is good by default, so that speed is what matters.","terms":[]}},{"id":"time-2023-shut-it-all-down","name":"Pausing AI Developments Isn't Enough. We Need to Shut it All Down","type":"document"},{"id":"cn-generative-ai-interim-measures-2023","name":"Interim Measures for the Management of Generative Artificial Intelligence Services (生成式人工智能服务管理暂行办法), Order No. 15","type":"document","documentVersion":{"family":"cn-generative-ai-interim-measures","label":"Order No. 15, dated 10 July 2023","publisherId":"cyberspace-administration-of-china","publishedAt":"2023-07-10","effectiveAt":"2023-08-15","dateNote":"The order is dated 10 July 2023 and takes effect on 15 August 2023. The Cyberspace Administration’s site posted it on 13 July 2023. Later amendments, if any, were not checked."}},{"id":"task-based-exposure-measurement","name":"Exposure to automation measured from task content","type":"concept","proposition":{"code":"M07","criterion":"A text that estimates the share of jobs, occupations or tasks exposed or susceptible to computerisation or AI from task or occupation descriptions.","terms":[]}},{"id":"aghion-jones-jones-2017-ai-and-economic-growth","name":"Artificial Intelligence and Economic Growth","type":"document"},{"id":"benzell-et-al-2015-robots-are-us","name":"Robots Are Us: Some Economics of Human Replacement","type":"document"},{"id":"furman-2019-automation-future-past","name":"Should We Be Reassured If Automation in the Future Looks Like Automation in the Past?","type":"document"},{"id":"machine-intelligence-exceeds-humans-in-all-domains","name":"Machine intelligence exceeding human cognition in essentially all domains","type":"concept","proposition":{"code":"E02","criterion":"A text that states or models the possibility of machine intelligence that surpasses humans across essentially all cognitive tasks (superintelligence, AGI beyond human level). Machines doing all economically valuable work more cheaply is M05 and bears on E02 only if cognitive superiority is stated.","terms":[]}},{"id":"restrepo-2025-we-wont-be-missed","name":"We Won't be Missed: Work and Growth in the AGI World","type":"document"},{"id":"character-ai","name":"Character.AI","type":"organisation"},{"id":"chelsea-finn","name":"Chelsea Finn","type":"person"},{"id":"dominic-perella","name":"Dominic Perella","type":"person"},{"id":"liam-fedus","name":"Liam Fedus","type":"person"},{"id":"meta-superintelligence-labs","name":"Meta Superintelligence Labs","type":"organisation"},{"id":"shuchao-bi","name":"Shuchao Bi","type":"person"},{"id":"sunita-verma","name":"Sunita Verma","type":"person"},{"id":"tencent","name":"Tencent / 腾讯","type":"organisation"},{"id":"robin-hanson","name":"Robin Hanson","type":"person"},{"id":"laurence-j-kotlikoff","name":"Laurence J. Kotlikoff","type":"person"},{"id":"aiia-ai-safety-commitments-2024","name":"Artificial Intelligence Safety Commitments (人工智能安全承诺), December 2024","type":"document","documentVersion":{"family":"aiia-ai-safety-commitments","label":"December 2024","publisherId":"aiia","publishedAt":"2024-12","dateNote":"Cover dated 2024年12月; initial signatories signed at a CAICT forum on 23 December 2024 and the text and list were posted on 24 December 2024. No effective date is stated. A later 2025 framework text (中国人工智能安全承诺框架) was not inspected."}},{"id":"minimax-01-readme","name":"MiniMax-01 repository README","type":"document"},{"id":"minimax-m2-licence-2025-10","name":"MiniMax-M2 licence (MIT License, 27 October 2025 text)","type":"document"},{"id":"qihoo-360","name":"360 / 三六零","type":"organisation"},{"id":"seed-coder-report","name":"Seed-Coder: Let the Code Model Curate Data for Itself","type":"document"},{"id":"axiom-odc-nodes","name":"Axiom Space ODC Nodes 1 and 2 (ARC 1 and ARC 2)","type":"infrastructure"},{"id":"axiom-space","name":"Axiom Space","type":"organisation"},{"id":"naman-goyal","name":"Naman Goyal","type":"person"},{"id":"aib-doc-afdb-nar-2024","name":"AlphaFold Protein Structure Database in 2024: providing structure coverage for over 214 million protein sequences","type":"document"},{"id":"aib-doc-esm3-release-2024","name":"ESM3: Simulating 500 million years of evolution with a language model","type":"document"},{"id":"aib-prop-ml-designs-new-proteins","name":"Machine-learning methods make proteins with new functions designable","type":"concept","proposition":{"code":"P4","criterion":"The text states that machine-learning models can be used, or will contribute, to designing proteins with functions, or sequences, not found among natural proteins.","terms":[],"withheld":[{"role":"earliest-located","reason":"Withheld until the criterion is decided (maintainer decision of 2026-10-30). The cross-family check located earlier candidates, Schneider and Wrede (1994) on sequence design assisted by neural networks and Greener, Moffat and Jones (arXiv, 26 June 2018) on sequences for a novel protein topology. Whether either meets the criterion’s “not found among natural proteins” is unsettled.","recordedAt":"2026-10-31"}]}},{"id":"kp-learning-evaluating-general-linguistic-2019","name":"Learning and Evaluating General Linguistic Intelligence","type":"document"},{"id":"kp-bert-pre-training-deep-bidirectional-2019","name":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","type":"document"},{"id":"kp-training-helpful-harmless-assistant-reinforcement-2022","name":"Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback","type":"document"},{"id":"kp-algorithms-inverse-reinforcement-learning-2000","name":"Algorithms for Inverse Reinforcement Learning","type":"document"},{"id":"kp-deep-contextualized-word-representations-2018","name":"Deep contextualized word representations","type":"document"},{"id":"kp-imagenet-classification-deep-convolutional-neural-2012","name":"ImageNet classification with deep convolutional neural networks","type":"document"},{"id":"kp-llama-2-open-foundation-fine-2023","name":"Llama 2: Open Foundation and Fine-Tuned Chat Models","type":"document"},{"id":"kp-guided-cost-learning-deep-inverse-2016","name":"Guided Cost Learning: Deep Inverse Optimal Control via Policy Optimization","type":"document"},{"id":"kp-lamda-language-models-dialog-applications-2022","name":"LaMDA: Language Models for Dialog Applications","type":"document"},{"id":"kp-palm-scaling-language-modeling-pathways-2022","name":"PaLM: Scaling Language Modeling with Pathways","type":"document"},{"id":"kp-ssd-single-shot-multibox-detector-2015","name":"SSD: Single Shot MultiBox Detector","type":"document"},{"id":"kp-distilling-knowledge-neural-network-2015","name":"Distilling the Knowledge in a Neural Network","type":"document"},{"id":"rewon-child","name":"Rewon Child","type":"person"},{"id":"kenton-lee","name":"Kenton Lee","type":"person"},{"id":"maarten-bosma","name":"Maarten Bosma","type":"person"},{"id":"martin-lau","name":"Lau Chi Ping Martin","type":"person"},{"id":"hunyuan-community-licence-a13b-2025","name":"Tencent Hunyuan Community License Agreement (Hunyuan A13B edition)","type":"document"}],"claims":[{"id":"issued-fsf-3-0","subject":"google-deepmind","predicate":"published","object":{"kind":"entity","entityId":"fsf-v3-0"},"topic":"governance","statement":"Google DeepMind published Frontier Safety Framework v3.0, identified by its publication date of 2025-09-22.","time":{"kind":"event","date":"2025-09-22","basis":"publication","note":"The sourced publication date does not establish an implementation or effective date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Publication means a public document expression exists. The date is labelled publication; publication is not evidence that its requirements were implemented or effective in practice.","evidenceIds":["evidence-issued-fsf-3-0"]},{"id":"brockman-openai-cto-2015","subject":"greg-brockman","predicate":"held_role","object":{"kind":"entity","entityId":"openai"},"topic":"people","statement":"OpenAI’s launch announcement identifies Greg Brockman as CTO.","time":{"kind":"snapshot","date":"2015-12-11","note":"Role snapshot at the dated source; no start, end or continuing appointment inferred."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Historical title snapshot, not a current role.","evidenceIds":["evidence-brockman-openai-cto-2015"],"attributes":{"role":"CTO"}},{"id":"prov-ms-fgf-2026-low-medium-deployment","subject":"ms-fgf-2026","predicate":"states_provision","object":{"kind":"literal","value":"Low or medium risk models may be deployed"},"topic":"governance","statement":"The February 2026 edition of the Frontier Governance Framework states that models assessed as posing low or medium risk may be deployed with appropriate safeguards as outlined in the framework.","time":{"kind":"event","date":"2026-02","basis":"revision","note":"Provision as stated in this edition, dated by the edition’s revision 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-ms-fgf-2026-low-medium-deployment"],"attributes":{"provision":{"kind":"exception","key":"msfgf-low-medium-deployment"}}},{"id":"sb-civil-penalty-cap","subject":"california-sb-53","predicate":"states_provision","object":{"kind":"literal","value":"Civil penalty up to $1,000,000 per violation"},"topic":"governance","statement":"Under SB 53, a large frontier developer that fails to publish or transmit a required compliant document, makes a statement prohibited by § 22757.12(e), fails to report an incident as required, or fails to comply with its own frontier AI framework is subject to a civil penalty. The penalty depends on the severity of the violation and may not exceed $1,000,000 per violation.","time":{"kind":"event","date":"2025-09-29","basis":"publication","note":"Provision as stated in the chaptered text published and approved on 2025-09-29; the added sections took effect on 2026-01-01. Text as chaptered on 2025-09-29; effective 2026-01-01. The codified § 22757.15 (checked 2026-10-04) shows no amendment note."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"What the enacted text states, quoted from the chaptered expression. It is not evidence that the statute applies to any named developer, or of compliance, enforcement or effect. The penalty provision names large frontier developers. Whether any penalty has been sought or imposed was not checked. A cap is not evidence of enforcement.","evidenceIds":["evidence-sb-civil-penalty-cap-1"],"attributes":{"provision":{"kind":"threshold","key":"sb53-civil-penalty-cap"}}},{"id":"ts-a3-good-1965-context","subject":"good-1965","predicate":"bears_on_proposition","object":{"kind":"entity","entityId":"recursive-self-improvement"},"topic":"ideas","statement":"Good’s chapter has an ultraintelligent machine design even better machines, and suggests that a machine reluctant to design its replacement could instead gradually improve itself by acquiring new equipment.","time":{"kind":"event","date":"1965","basis":"publication","note":"Year of Advances in Computers, volume 6, as catalogued by Open Library; the current Crossref record gives 1966. The discrepancy is unresolved."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Building a better successor does not meet the criterion, which requires the same system to improve.","evidenceIds":["evidence-ts-a3-good-1965-context"],"attributes":{"thought":{"roles":["context"],"register":"nonfiction","missing":"The ultraintelligent machine designs better successors, or alters itself by acquiring equipment; the chapter does not say that a machine improves its own capacity to improve.","claimed":{"date":"1962-10","note":"The chapter’s footnote on p. 31 names talks in October 1962 and January 1963, a first draft of April 1963 and a slightly emended version of May 1964. None was retrieved, so the wording is not dated to them."}}}},{"id":"yk-y22-time-2023-shut-it-all-down-c","subject":"time-2023-shut-it-all-down","predicate":"contests_proposition","object":{"kind":"entity","entityId":"build-superintelligence-fast"},"topic":"ideas","statement":"“Pausing AI Developments Isn't Enough. We Need to Shut it All Down” (2023-03-29) contests Y22. Concludes his TIME essay, which calls for an indefinite worldwide moratorium on large training runs, not a six-month pause; the same essay says anyone 'talking of arms races is a fool'.","time":{"kind":"event","date":"2023-03-29","basis":"publication","note":"Page metadata datePublished 2023-03-29T22:01:58Z. The page title currently reads \"The Only Way to Deal With the Threat From AI? Shut It Down\"; the headline is the one crossposted to LessWrong on 2023-04-08."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Premise addressed: Reaching superintelligence is good by default, so speed is what matters. TIME, 29 March 2023 (crossposted to LessWrong on 2023-04-08; TIME version used).","evidenceIds":["evidence-yk-t22-d"],"attributes":{"thought":{"roles":["contesting"],"register":"nonfiction","engagement":{"kind":"contrary-only","rationale":"Under the message-level rule, the passage states the contrary conclusion without giving a reason against the premise that reaching superintelligence is good by default, so speed is what matters, even when read with its message or dialogue turn."}}}},{"id":"cn-genai-measures-security-assessment","subject":"cn-generative-ai-interim-measures-2023","predicate":"states_provision","object":{"kind":"literal","value":"Services with public-opinion attributes or social-mobilisation capacity need a security assessment and algorithm filing"},"topic":"governance","statement":"Article 17 of the Measures provides that providers of generative AI services with public-opinion attributes or social-mobilisation capacity shall carry out a security assessment in accordance with relevant state provisions and complete the algorithm filing, change and cancellation procedures under the Provisions on the Management of Algorithmic Recommendations in Internet Information Services.","time":{"kind":"event","date":"2023-07-10","basis":"publication","note":"Provision as stated in the order dated 2023-07-10; effective 2023-08-15."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"English rendering by a machine agent from the Chinese text, which controls; the rendering of “舆论属性或者社会动员能力” is a translation choice. The text does not say which services have these attributes, and no record shows that any frontier developer’s service was assessed or filed. 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-cn-genai-measures-security-assessment-1"],"attributes":{"provision":{"kind":"required_action","key":"cn-genai-security-assessment"}}},{"id":"ec-m07-furman-2019-automation-future-past-b","subject":"furman-2019-automation-future-past","predicate":"bears_on_proposition","object":{"kind":"entity","entityId":"task-based-exposure-measurement"},"topic":"ideas","statement":"Furman, “Should We Be Reassured If Automation in the Future Looks Like Automation in the Past?” (2019-05) bears on M07. Furman reports the range of published estimates of jobs at risk of automation and emphasises the wage/skill gradient of exposure.","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. Furman relays other authors' estimates (Arntz, Gregory and Zierahn 2016; Frey and Osborne 2013); the cached text layer reads 'Co- operation'. Cite the original studies for the estimates.","evidenceIds":["evidence-ec-m07-03"],"attributes":{"thought":{"roles":["context"],"register":"relay","missing":"Reports others' exposure estimates; makes no estimate of its own.","tier":{"value":1,"basis":"Chapter of the NBER Economics of AI volume (core venue)."}}}},{"id":"ec-e02-restrepo-2025-we-wont-be-missed-b","subject":"restrepo-2025-we-wont-be-missed","predicate":"bears_on_proposition","object":{"kind":"entity","entityId":"machine-intelligence-exceeds-humans-in-all-domains"},"topic":"ideas","statement":"Restrepo, “We Won't be Missed: Work and Growth in the AGI World” (2025-10) bears on E02. Restrepo's chapter for the NBER volume The Economics of Transformative AI; the abstract derives labour-share convergence to zero.","time":{"kind":"event","date":"2025-10","basis":"publication","note":"Crossref issued 2025-10. PDF refused (HTTP 403); NBER abstract page used. Checked in a current copy; an archive capture was not available, so earlier bytes are not authenticated."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"NBER w34423, October 2025; abstract page only.","evidenceIds":["evidence-ec-e02-16"],"attributes":{"thought":{"roles":["context"],"register":"nonfiction","missing":"All economically valuable work done by compute (M05); no statement that machine cognition surpasses human cognition.","tier":{"value":1,"basis":"NBER working paper (core venue); Restrepo is an economist."}}}},{"id":"lg-oai-ilya-sutskever-nonprofit-board-2019","subject":"ilya-sutskever","predicate":"held_role","object":{"kind":"entity","entityId":"openai-inc"},"topic":"governance","statement":"OpenAI’s OpenAI LP announcement of 11 March 2019 lists Ilya Sutskever as a member of the OpenAI Nonprofit board and as an OpenAI LP employee with the designation Chief Scientist.","time":{"kind":"snapshot","date":"2019-03-11","note":"Board as of 11 March 2019, as the source’s footnote states."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"A board list as of 11 March 2019 (the source’s footnote); it does not establish when the person joined or left the board. The source gives the nonprofit’s legal name as OpenAI Inc.","evidenceIds":["lg-ev-oai-ilya-sutskever-nonprofit-board-2019","lg-ev-oai-ilya-sutskever-nonprofit-board-2019-inc"],"attributes":{"role":"Board member; listed as Chief Scientist"}},{"id":"lg-gw-fedus-openai-departure-2025","subject":"liam-fedus","predicate":"departure_announced","object":{"kind":"entity","entityId":"openai"},"topic":"people","statement":"Liam Fedus posted on X on 17 March 2025 a message to his OpenAI colleagues saying that he had decided to leave OpenAI as an employee.","time":{"kind":"event","date":"2025-03-17","note":"Date of the X post (20:59 UTC); not a last working day."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The post establishes the announcement; the role left is taken from TechCrunch’s report of the same day (reporting). The post as retrieved is truncated and does not give a last working day; the record does not establish the terms of any later partnership with OpenAI.","evidenceIds":["lg-ev-gw-fedus-openai-departure-2025","lg-ev-gw-fedus-openai-departure-2025-tc"],"attributes":{"role":"VP of research for post-training"}},{"id":"lg-deal-perella-character-ai-clo-2025","subject":"dominic-perella","predicate":"held_role","object":{"kind":"entity","entityId":"character-ai"},"topic":"people","statement":"Character.AI announced on 20 June 2025 that Dominic Perella would take on a new role as Chief Legal Officer & SVP of Global Affairs.","time":{"kind":"snapshot","date":"2025-06-20","note":"Announcement date; not a start date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Announced role; the post does not mention the interim CEO title.","evidenceIds":["lg-ev-deal-perella-character-ai-clo-2025"],"attributes":{"activityStage":"announced","role":"Chief Legal Officer & SVP of Global Affairs"}},{"id":"lg-mx-bi-msl-2025","subject":"shuchao-bi","predicate":"held_role","object":{"kind":"entity","entityId":"meta-superintelligence-labs"},"topic":"people","statement":"Mark Zuckerberg's memo of 30 June 2025, as published by CNBC, names Shuchao Bi, described as having led multimodal post-training at OpenAI, among new MSL team members.","time":{"kind":"snapshot","date":"2025-06-30","note":"Memo date; no start date is given."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The record rests on reporting: the memo text as published by CNBC. Prior work is Meta's characterisation.","evidenceIds":["lg-ev-mx-bi-msl-2025"],"attributes":{"role":"Team member, Meta Superintelligence Labs"}},{"id":"lg-deal-verma-google-core-labs-prior","subject":"sunita-verma","predicate":"held_role","object":{"kind":"entity","entityId":"google"},"topic":"people","statement":"Character.AI's announcement of 5 December 2024 states that Sunita Verma most recently served as Vice President & General Manager of Google's Core Labs.","time":{"kind":"unknown","note":"Described on 2024-12-05 as her most recent role before Character.AI; dates not stated."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Biographical statement in Character.AI's announcement; no Google source was retrieved.","evidenceIds":["lg-ev-deal-verma-google-core-labs-prior"],"attributes":{"role":"Vice President & General Manager, Core Labs"}},{"id":"lg-gw-dean-cofounded-google-brain","subject":"jeff-dean","predicate":"co_founded","object":{"kind":"entity","entityId":"google-brain"},"topic":"people","statement":"A Johns Hopkins University seminar announcement for Jeff Dean’s lecture of 26 April 2018 states in its speaker biography that he co-founded the Google Brain team.","time":{"kind":"unknown","note":"The biography gives no founding date; Google DeepMind’s organisation page dates Google Brain’s start to 2011 (recorded separately)."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The record rests on a speaker biography published by a university department, not on a Google document. Jeff Dean’s Google Research profile returned HTTP 404 on 15 October 2026 and could not be checked; no archive capture could be retrieved. The record does not establish the date, the other co-founders or the terms of the founding.","evidenceIds":["lg-ev-gw-dean-cofounded-google-brain"],"attributes":{"role":"co-founder"}},{"id":"cmp-fsf-v2-0-d3-halt","subject":"fsf-v2-0","predicate":"states_provision","object":{"kind":"literal","value":"Pause, non-deployment or non-training"},"topic":"governance","statement":"FSF · v2.0 states a provision on the comparison question “Pause, non-deployment or non-training”.","time":{"kind":"event","date":"2025-02-04","basis":"publication","note":"Comparison cell for this edition, dated by the edition’s publication date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Conditional wording ('may involve'). Deployment is also conditioned on safety-case approval (see “Determination of capability or safeguard adequacy”). What the edition states, quoted from the cited expression. It is not evidence of implementation, compliance or effectiveness, and a shared question does not make two editions’ provisions equivalent.","evidenceIds":["ev-cmp-fsf-v2-0-d3-halt-1"],"attributes":{"provision":{"kind":"required_action","key":"comparison-d3-halt","facet":{"id":"D3.halt","status":"stated"}}}},{"id":"cmp-fsf-v3-0-d4-oversight","subject":"fsf-v3-0","predicate":"provision_not_found","object":{"kind":"literal","value":"Board or external oversight"},"topic":"governance","statement":"No passage meeting the comparison question “Board or external oversight” 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: the comparison question asks for the following. A role the edition gives to a board, board committee, trust, or external party in overseeing or reviewing those decisions. The inspected scope of FSF · v3.0 was: Whole text layer, PDF pp. 1–16 (all sections, tables, footnotes and §5.3 read). Method: the edition was read in full and its text layer searched case-insensitively for board, council, oversight, external, third party / independent, trust. Hits examined and not counted: No hits for board, council or trust. 'oversight' hits concern model behaviour ('deployed without adequate control and oversight', PDF p. 12; 'circumvent basic oversight mechanisms', PDF p. 15). 'external' hits: 'involving internal and external experts as needed' (PDF p. 6) and 'external evaluations' (PDF p. 5) are inputs to assessment; 'we may engage relevant and appropriate external actors, including governments, to inform our responsible development and deployment practices' (PDF p. 5) informs practices, not decisions; the remainder concern external deployment or disclosure (“Public or external reporting”). 'independent' hits only 'model independent information' (PDF p. 5). Internal review by the 'appropriate governance function' and 'appropriate corporate governance bodies' is recorded under “Determination of capability or safeguard adequacy” and “Revision process and approval”. 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":["ev-cmp-fsf-v3-0-d4-oversight"],"attributes":{"provision":{"kind":"decision_authority","key":"comparison-d4-oversight","facet":{"id":"D4.oversight"}}}},{"id":"ap-robin-hanson-hanson-2008-what-core-argument","subject":"robin-hanson","predicate":"authored","object":{"kind":"entity","entityId":"hanson-2008-what-core-argument"},"topic":"ideas","statement":"“What Core Argument?” (2008-12) credits Robin Hanson as its author.","time":{"kind":"event","date":"2008-12","basis":"publication","note":"Date the source record gives for this text; authorship is credited in the inspected expression."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Credited authorship of this expression; it says nothing about priority for the ideas discussed.","evidenceIds":["evidence-ap-robin-hanson-hanson-2008-what-core-argument"]},{"id":"ap-laurence-j-kotlikoff-benzell-et-al-2015-robots-are-us","subject":"laurence-j-kotlikoff","predicate":"authored","object":{"kind":"entity","entityId":"benzell-et-al-2015-robots-are-us"},"topic":"ideas","statement":"“Robots Are Us: Some Economics of Human Replacement” (2015-02) credits Laurence J. Kotlikoff as one of its 4 authors.","time":{"kind":"event","date":"2015-02","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 co-authorship; it does not allocate parts of the text between authors or imply agreement with every passage.","evidenceIds":["evidence-ap-laurence-j-kotlikoff-benzell-et-al-2015-robots-are-us"]},{"id":"cmp-rsp-v3-3-d7-external","subject":"rsp-v3-3","predicate":"states_provision","object":{"kind":"literal","value":"Public or external reporting"},"topic":"governance","statement":"RSP · v3.3 states a provision on the comparison question “Public or external reporting”.","time":{"kind":"event","date":"2026-05-26","basis":"effective","note":"Comparison cell for this edition, dated by the edition’s effective date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Also: the Frontier Safety Roadmap is published in redacted form (§2); external reviewers are asked to publish commentary within 30 days (§3.6.2); in the novel chemical/biological weapons row (PDF p. 7), the company column says threat-pathway content and policy recommendations will be shared with policymakers; where a noncompliance report is substantiated and involves a material safety risk, Anthropic “may” give public notice (§4). What the edition states, paraphrased from the cited expression with its page. It is not evidence of implementation, compliance or effectiveness, and a shared question does not make two editions’ provisions equivalent.","evidenceIds":["ev-cmp-rsp-v3-3-d7-external-1"],"attributes":{"provision":{"kind":"reporting","key":"comparison-d7-external","facet":{"id":"D7.external","status":"stated"}}}},{"id":"cmp-preparedness-beta-2023-d1-cbrn","subject":"preparedness-beta-2023","predicate":"states_provision","object":{"kind":"literal","value":"Chemical, biological, radiological or nuclear weapons"},"topic":"governance","statement":"Preparedness · Beta states a provision on the comparison question “Chemical, biological, radiological or nuclear weapons”.","time":{"kind":"event","date":"2023-12-18","basis":"publication","note":"Comparison cell for this edition, dated by the edition’s publication date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"A single Tracked Risk Category covers chemical, biological, radiological and nuclear threats together, with a Low to Critical table (PDF p. 9). What the edition states, paraphrased from the cited expression with its page. It is not evidence of implementation, compliance or effectiveness, and a shared question does not make two editions’ provisions equivalent.","evidenceIds":["ev-cmp-preparedness-beta-2023-d1-cbrn-1"],"attributes":{"provision":{"kind":"risk_domain","key":"comparison-d1-cbrn","facet":{"id":"D1.cbrn","status":"stated"}}}},{"id":"cmp-faif-2025-d1-other","subject":"faif-2025","predicate":"states_provision","object":{"kind":"literal","value":"Other named domains"},"topic":"governance","statement":"FAIF · December 2025 edition states a provision on the comparison question “Other named domains”.","time":{"kind":"event","date":"2025-12-30","basis":"revision","note":"Comparison cell for this edition, dated by the edition’s revision date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Dishonesty (deception) is tracked as a concerning propensity within the loss-of-control category, with this numeric criterion; sycophancy is measured without a stated threshold (PDF p. 7). What the edition states, paraphrased from the cited expression with its page. It is not evidence of implementation, compliance or effectiveness, and a shared question does not make two editions’ provisions equivalent.","evidenceIds":["ev-cmp-faif-2025-d1-other-1"],"attributes":{"provision":{"kind":"risk_domain","key":"comparison-d1-other","facet":{"id":"D1.other","status":"stated"}}}},{"id":"cmp-ms-fgf-2026-d1-cyber","subject":"ms-fgf-2026","predicate":"states_provision","object":{"kind":"literal","value":"Cyber operations"},"topic":"governance","statement":"Microsoft FGF · Feb 2026 states a provision on the comparison question “Cyber operations”.","time":{"kind":"event","date":"2026-02","basis":"revision","note":"Comparison cell for this edition, dated by the edition’s revision date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Capability thresholds in Appendix I (PDF p. 13). What the edition states, paraphrased from the cited expression with its page. It is not evidence of implementation, compliance or effectiveness, and a shared question does not make two editions’ provisions equivalent.","evidenceIds":["ev-cmp-ms-fgf-2026-d1-cyber-1"],"attributes":{"provision":{"kind":"risk_domain","key":"comparison-d1-cyber","facet":{"id":"D1.cyber","status":"stated"}}}},{"id":"c2-governance-aiia-aisc-signatory-qihoo-360","subject":"qihoo-360","predicate":"signed_commitment","object":{"kind":"entity","entityId":"aiia-ai-safety-commitments-2024"},"topic":"governance","statement":"360 is listed, as 三六零安全科技股份有限公司, among the 17 companies on the initial signatory list (首批签署企业名单) of the AIIA AI Safety Commitments posted by CAICT on 24 December 2024.","time":{"kind":"event","date":"2024-12-24","basis":"publication","note":"Date of the post that published the list. The post says the 17 companies of the initial batch signed at a CAICT forum on 23 December 2024; that is the publisher's statement, and the signing of each company is not separately dated."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The list names the legal entity 三六零安全科技股份有限公司. The record maps it to the group-level entity 360, which carries that name as an alias; the mapping rests on the company name, and no claim is made about group structure or about which group company is bound. A listing is the publisher’s statement, dated by the post; it is not a signature date and not evidence that the company complied with or implemented the commitments. A later total of 22 signatories is reported, but no later list was retrieved.","evidenceIds":["c2-ev-governance-aiia-aisc-signatory-qihoo-360-1","c2-ev-governance-aiia-aisc-signatory-qihoo-360-2"],"attributes":{"commitment":{"stage":"listed"}}},{"id":"c2-governance-aiia-aisc-signatory-zhipu","subject":"zhipu","predicate":"signed_commitment","object":{"kind":"entity","entityId":"aiia-ai-safety-commitments-2024"},"topic":"governance","statement":"Zhipu AI is listed, as 北京智谱华章科技有限公司, among the 17 companies on the initial signatory list (首批签署企业名单) of the AIIA AI Safety Commitments posted by CAICT on 24 December 2024.","time":{"kind":"event","date":"2024-12-24","basis":"publication","note":"Date of the post that published the list. The post says the 17 companies of the initial batch signed at a CAICT forum on 23 December 2024; that is the publisher's statement, and the signing of each company is not separately dated."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The list names the legal entity 北京智谱华章科技有限公司. The record maps it to the group-level entity Zhipu AI, which carries that name as an alias; the mapping rests on the company name, and no claim is made about group structure or about which group company is bound. A listing is the publisher’s statement, dated by the post; it is not a signature date and not evidence that the company complied with or implemented the commitments. A later total of 22 signatories is reported, but no later list was retrieved.","evidenceIds":["c2-ev-governance-aiia-aisc-signatory-zhipu-1","c2-ev-governance-aiia-aisc-signatory-zhipu-2"],"attributes":{"commitment":{"stage":"listed"}}},{"id":"c2-minimax-01-readme","subject":"minimax","predicate":"published","object":{"kind":"entity","entityId":"minimax-01-readme"},"topic":"ideas","statement":"MiniMax’s MiniMax-01 GitHub repository README, at a commit of 15 January 2025, introduced two models, MiniMax-Text-01 and MiniMax-VL-01.","time":{"kind":"event","date":"2025-01-15","basis":"publication","note":"Date of the cited README commit; the repository’s initial commit is dated 14 January 2025. The prospectus dates the launch of MiniMax-Text-01 to January 2025."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The README’s descriptions are the developer’s own; benchmark claims are out of scope.","evidenceIds":["c2-ev-minimax-01-readme","c2-ev-minimax-01-readme-pros"]},{"id":"c2-minimax-m2-licence-oct","subject":"minimax","predicate":"published","object":{"kind":"entity","entityId":"minimax-m2-licence-2025-10"},"topic":"governance","statement":"The MiniMax-M2 GitHub repository carried an MIT License text with a 2025 MiniMax AI copyright notice as of a commit of 27 October 2025.","time":{"kind":"event","date":"2025-10-27","basis":"publication","note":"Date of the cited commit."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The licence is described as the text describes itself. The file was changed on 13 November 2025 (recorded separately). The repository’s initial commit, dated 25 October 2025 at 21:28 UTC (26 October in UTC+8), carried the Apache License 2.0 text, which the MIT text replaced on 27 October 2025; the same-family audit found this in a Git clone and the cross-family check confirmed the initial text and its date.","evidenceIds":["c2-ev-minimax-m2-licence-oct","c2-ev-minimax-m2-licence-oct-copyright"]},{"id":"cmp-meta-faf-v1-1-d7-external","subject":"meta-faf-v1-1","predicate":"states_provision","object":{"kind":"literal","value":"Public or external reporting"},"topic":"governance","statement":"Meta FAF · v1.1 states a provision on the comparison question “Public or external reporting”.","time":{"kind":"event","date":"2025-02-03","basis":"publication","note":"Comparison cell for this edition, dated by the edition’s publication date."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Conditional wording (“plan to”). The channels named are model cards, research papers and guidance on responsible use; no deadline, recipient or mandatory incident report is stated. What the edition states, paraphrased from the cited expression with its page. It is not evidence of implementation, compliance or effectiveness, and a shared question does not make two editions’ provisions equivalent.","evidenceIds":["ev-cmp-meta-faf-v1-1-d7-external-1"],"attributes":{"provision":{"kind":"reporting","key":"comparison-d7-external","facet":{"id":"D7.external","status":"stated"}}}},{"id":"cpo-orb-axiom-odc-launch-stated","subject":"axiom-space","predicate":"launch_stated","object":{"kind":"entity","entityId":"axiom-odc-nodes"},"topic":"compute","statement":"Axiom Space states that its first two orbital data centre nodes launched to low Earth orbit on 11 January 2026, with the first tranche of Kepler Communications' optical relay constellation.","time":{"kind":"event","date":"2026-01-11","basis":"announcement","note":"Date as stated on an undated Axiom page read on 2026-10-28. Dated by the statement of the launch."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Operator statement; the vehicle is not named, and the stated launch came after the end-2025 target.","evidenceIds":["evidence-cpo-orb-axiom-odc-launch-stated-1","evidence-cpo-orb-axiom-odc-launch-stated-2","evidence-cpo-orb-axiom-odc-launch-stated-3"]},{"id":"aib-mod-afdb-214-million","subject":"aib-doc-afdb-nar-2024","predicate":"states_provision","object":{"kind":"literal","value":"Over 214 million predicted structures, up from 300k in 2021"},"topic":"ideas","statement":"Varadi et al. (Nucleic Acids Research, 2024 database issue) state that the AlphaFold Protein Structure Database has amassed over 214 million predicted protein structures, expanding from the initial 300k structures released in 2021.","time":{"kind":"event","date":"2024-01-05","basis":"publication","note":"Issue (collection) date of the database issue; the date of first online publication is not stated in the retrieved expression."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The providers' statement of their own holdings as of that paper. The paper's \"groundbreaking\" characterisation of AlphaFold2 is its own wording and is not adopted here. The figure of 300k for 2021 differs in rounding from the over 360,000 stated in the 2022 paper.","evidenceIds":["evidence-aib-mod-afdb-214-million-1"],"attributes":{"provision":{"kind":"statement","key":"mod-afdb-214-million"}}},{"id":"aib-arg-p4-esm3-2024","subject":"aib-doc-esm3-release-2024","predicate":"articulates_proposition","object":{"kind":"entity","entityId":"aib-prop-ml-designs-new-proteins"},"topic":"ideas","statement":"EvolutionaryScale's ESM3 announcement (dated 25 June 2024) states that its language model generated a new fluorescent protein, esmGFP, with a sequence only 58% similar to the closest known fluorescent protein.","time":{"kind":"event","date":"2024-06-25","basis":"announcement","note":"Date printed on the post; the wording is attested in the copy served on 2026-10-30, which carries a January 2025 update notice."},"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. A company's statement about its own model; the estimate that the result is \"equivalent to simulating over 500 million years of evolution\" is the company's. The post describes generation and screening steps; only its summary statements are cited.","evidenceIds":["evidence-aib-arg-p4-esm3-2024-1","evidence-aib-arg-p4-esm3-2024-2"],"attributes":{"thought":{"roles":["articulation"],"register":"nonfiction","qualifier":"A company's statement of a sequence distant from known natural proteins with a known (fluorescent) function."}}},{"id":"kp-states-aghion-jones-jones-2017-ai-and-economic-growth-2","subject":"aghion-jones-jones-2017-ai-and-economic-growth","predicate":"states_contribution","object":{"kind":"literal","value":"The authors state that their goal is to refine a set of questions about artificial intelligence and economic growth and to contribute to an agenda for the field."},"topic":"ideas","statement":"The authors state that their goal is to refine a set of questions about artificial intelligence and economic growth and to contribute to an agenda for the field.","time":{"kind":"event","date":"2017-10","basis":"publication","note":"Date of the version quoted, as its source gives it (October 2017); other 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-aghion-jones-jones-2017-ai-and-economic-growth-2-1"]},{"id":"kp-cites-lg-src-new-yogatama-dm-2019-bert-pre-training-deep-bidirectional-2019","subject":"kp-learning-evaluating-general-linguistic-2019","predicate":"cites","object":{"kind":"entity","entityId":"kp-bert-pre-training-deep-bidirectional-2019"},"topic":"ideas","statement":"Learning and Evaluating General Linguistic Intelligence (arXiv:1901.11373v1) cites BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding.","time":{"kind":"event","date":"2019-01-31","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-lg-src-new-yogatama-dm-2019-bert-pre-training-deep-bidirectional-2019-1"]},{"id":"kp-cites-weak-strong-paper-training-helpful-harmless-assistant-reinforcement-2022","subject":"weak-strong-paper","predicate":"cites","object":{"kind":"entity","entityId":"kp-training-helpful-harmless-assistant-reinforcement-2022"},"topic":"ideas","statement":"Weak-to-Strong Generalization: Eliciting Strong Capabilities With Weak Supervision cites Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback.","time":{"kind":"event","date":"2023-12-14","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-weak-strong-paper-training-helpful-harmless-assistant-reinforcement-2022-1"]},{"id":"kp-cites-human-preferences-paper-algorithms-inverse-reinforcement-learning-2000","subject":"human-preferences-paper","predicate":"cites","object":{"kind":"entity","entityId":"kp-algorithms-inverse-reinforcement-learning-2000"},"topic":"ideas","statement":"Deep reinforcement learning from human preferences cites Algorithms for Inverse Reinforcement Learning.","time":{"kind":"event","date":"2017-06-12","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-human-preferences-paper-algorithms-inverse-reinforcement-learning-2000-1"]},{"id":"kp-cites-amplification-paper-algorithms-inverse-reinforcement-learning-2000","subject":"amplification-paper","predicate":"cites","object":{"kind":"entity","entityId":"kp-algorithms-inverse-reinforcement-learning-2000"},"topic":"ideas","statement":"Supervising strong learners by amplifying weak experts cites Algorithms for Inverse Reinforcement Learning.","time":{"kind":"event","date":"2018-10-19","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-amplification-paper-algorithms-inverse-reinforcement-learning-2000-1"]},{"id":"kp-cites-miri-ml-agenda-imagenet-classification-deep-convolutional-neural-2012","subject":"miri-ml-agenda","predicate":"cites","object":{"kind":"entity","entityId":"kp-imagenet-classification-deep-convolutional-neural-2012"},"topic":"ideas","statement":"Alignment for Advanced Machine Learning Systems cites ImageNet classification with deep convolutional neural networks.","time":{"kind":"event","date":"2016","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-miri-ml-agenda-imagenet-classification-deep-convolutional-neural-2012-1"]},{"id":"kp-cites-seed-coder-report-llama-2-open-foundation-fine-2023","subject":"seed-coder-report","predicate":"cites","object":{"kind":"entity","entityId":"kp-llama-2-open-foundation-fine-2023"},"topic":"ideas","statement":"Seed-Coder: Let the Code Model Curate Data for Itself cites Llama 2: Open Foundation and Fine-Tuned Chat Models.","time":{"kind":"event","date":"2025-06-04","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-seed-coder-report-llama-2-open-foundation-fine-2023-1"]},{"id":"kp-authored-kenton-lee-deep-contextualized-word-representations-2018","subject":"kenton-lee","predicate":"authored","object":{"kind":"entity","entityId":"kp-deep-contextualized-word-representations-2018"},"topic":"ideas","statement":"Kenton Lee is a credited author of Deep contextualized word representations.","time":{"kind":"event","date":"2018-02-15","basis":"publication","note":"Date of the work’s earliest recorded version, arXiv version 1, submitted 15 February 2018 (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-kenton-lee-deep-contextualized-word-representations-2018-1"]},{"id":"kp-authored-naman-goyal-llama-2-open-foundation-fine-2023","subject":"naman-goyal","predicate":"authored","object":{"kind":"entity","entityId":"kp-llama-2-open-foundation-fine-2023"},"topic":"ideas","statement":"Naman Goyal is a credited author of Llama 2: Open Foundation and Fine-Tuned Chat Models.","time":{"kind":"event","date":"2023-07-18","basis":"publication","note":"Date of the work’s earliest recorded version, arXiv version 1, submitted 18 July 2023 (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-naman-goyal-llama-2-open-foundation-fine-2023-1"]},{"id":"kp-authored-chelsea-finn-guided-cost-learning-deep-inverse-2016","subject":"chelsea-finn","predicate":"authored","object":{"kind":"entity","entityId":"kp-guided-cost-learning-deep-inverse-2016"},"topic":"ideas","statement":"Chelsea Finn is a credited author of Guided Cost Learning: Deep Inverse Optimal Control via Policy Optimization.","time":{"kind":"event","date":"2016-03-01","basis":"publication","note":"Date of the work’s earliest recorded version, arXiv version 1, submitted 1 March 2016 (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-chelsea-finn-guided-cost-learning-deep-inverse-2016-1"]},{"id":"kp-authored-maarten-bosma-lamda-language-models-dialog-applications-2022","subject":"maarten-bosma","predicate":"authored","object":{"kind":"entity","entityId":"kp-lamda-language-models-dialog-applications-2022"},"topic":"ideas","statement":"Maarten Bosma is a credited author of LaMDA: Language Models for Dialog Applications.","time":{"kind":"event","date":"2022-01-20","basis":"publication","note":"Date of the work’s earliest recorded version, arXiv version 1, submitted 20 January 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-maarten-bosma-lamda-language-models-dialog-applications-2022-1"]},{"id":"kp-authored-rewon-child-palm-scaling-language-modeling-pathways-2022","subject":"rewon-child","predicate":"authored","object":{"kind":"entity","entityId":"kp-palm-scaling-language-modeling-pathways-2022"},"topic":"ideas","statement":"Rewon Child 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-rewon-child-palm-scaling-language-modeling-pathways-2022-1"]},{"id":"kp-authored-jeff-dean-palm-scaling-language-modeling-pathways-2022","subject":"jeff-dean","predicate":"authored","object":{"kind":"entity","entityId":"kp-palm-scaling-language-modeling-pathways-2022"},"topic":"ideas","statement":"Jeff Dean 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-jeff-dean-palm-scaling-language-modeling-pathways-2022-1"]},{"id":"kp-authored-christian-szegedy-ssd-single-shot-multibox-detector-2015","subject":"christian-szegedy","predicate":"authored","object":{"kind":"entity","entityId":"kp-ssd-single-shot-multibox-detector-2015"},"topic":"ideas","statement":"Christian Szegedy is a credited author of SSD: Single Shot MultiBox Detector.","time":{"kind":"event","date":"2015-12-08","basis":"publication","note":"Date of the work’s earliest recorded version, arXiv version 1, submitted 8 December 2015 (UTC)."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Authorship as credited in the byline of the text read; it implies neither sole authorship nor a role, and no affiliation is recorded.","evidenceIds":["evidence-kp-authored-christian-szegedy-ssd-single-shot-multibox-detector-2015-1"]},{"id":"kp-authored-jeff-dean-distilling-knowledge-neural-network-2015","subject":"jeff-dean","predicate":"authored","object":{"kind":"entity","entityId":"kp-distilling-knowledge-neural-network-2015"},"topic":"ideas","statement":"Jeff Dean is a credited author of Distilling the Knowledge in a Neural Network.","time":{"kind":"event","date":"2015-03-09","basis":"publication","note":"Date of the work’s earliest recorded version, arXiv version 1, submitted 9 March 2015 (UTC)."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Authorship as credited in the byline of the text read; it implies neither sole authorship nor a role, and no affiliation is recorded.","evidenceIds":["evidence-kp-authored-jeff-dean-distilling-knowledge-neural-network-2015-1"]},{"id":"c3-tencent-martin-lau-president","subject":"martin-lau","predicate":"held_role","object":{"kind":"entity","entityId":"tencent"},"topic":"people","statement":"Tencent's Annual Report 2025 lists Lau Chi Ping Martin as President among its senior management and states that he was promoted to President of the Company in 2006.","time":{"kind":"interval","from":"2006","note":"Start year as the report states it; the report, whose Chairman's Statement is signed and dated 18 March 2026, still lists him as President, which shows the role at that date only. The signature date is not a filing date. No end is recorded."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"The existing reported record (recorded separately) names 'President Martin Lau'; this record rests on the filing. His earlier directorship (2007 to 17 May 2023, per the report) is not recorded separately.","evidenceIds":["c3-ev-tencent-martin-lau-president","c3-ev-tencent-martin-lau-president-2"],"attributes":{"role":"President"}},{"id":"c3-tencent-a13b-licence-licensor","subject":"hunyuan-community-licence-a13b-2025","predicate":"states_provision","object":{"kind":"literal","value":"'Tencent' defined as the applicable entity or entities in the Tencent corporate family owning the rights in the Materials"},"topic":"governance","statement":"The Hunyuan A13B edition of the Tencent Hunyuan Community License Agreement defines 'Tencent', 'We' or 'Us' as the applicable entity or entities in the Tencent corporate family that own the rights embodied in or used by the Materials, where the Large and HunyuanVideo editions name THL A29 Limited.","time":{"kind":"event","date":"2025-08-21","basis":"revision","note":"Statement of the LICENSE at the cited revision 290ddb9a (21 August 2025). The agreement states a release date of 27 June 2025; the file was re-uploaded on 27 June 2025 with changes in whitespace and line endings only and is unchanged since."},"derivation":"explicit","resolution":"supported","editorialState":"seed","qualification":"Compares the definitions as the cited revisions state them; the agreement does not name the entity or entities, and none is inferred. The Tencent Hy Community License Agreement for Hy3 preview (2026) uses the same definition.","evidenceIds":["c3-ev-tencent-a13b-licence-licensor","c3-ev-tencent-a13b-licence-licensor-video"],"attributes":{"provision":{"kind":"statement","key":"tencent-a13b-licence-licensor"}}}],"sources":[{"id":"source-openai-launch","title":"Introducing OpenAI","authors":["Greg Brockman","Ilya Sutskever","OpenAI"],"publisher":"OpenAI","publisherId":"openai","publicationDate":"2015-12-11","version":"Dated page, inspected at retrieval","canonicalUrl":"https://openai.com/index/introducing-openai/","evidenceUrl":"https://openai.com/index/introducing-openai/","language":"en","archivedUrl":"https://web.archive.org/web/20260917013950/https://openai.com/index/introducing-openai/","archivedAt":"2026-09-17","accessedAt":"2026-09-17","reuse":{"attribution":"OpenAI, Introducing OpenAI (2015-12-11).","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and minimal attributed excerpts only. Recheck terms before wider redistribution."}},{"id":"source-good","title":"Speculations Concerning the First Ultraintelligent Machine","authors":["I. J. Good"],"publisher":"Academic Press","publicationDate":"1965","version":"Scanned reprint, Advances in Computers volume 6, pp. 31–88. Repository metadata identifies ©1965; the mirror filename says 1966.","canonicalUrl":"https://gwern.net/doc/ai/1966-good.pdf","evidenceUrl":"https://gwern.net/doc/ai/1966-good.pdf","language":"en","accessedAt":"2026-09-17","reuse":{"attribution":"Academic Press, Speculations Concerning the First Ultraintelligent Machine (1965).","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and minimal attributed excerpts only. Recheck terms before wider redistribution."}},{"id":"source-rsp-3-3","documentId":"rsp-v3-3","title":"Responsible Scaling Policy — v3.3","authors":["Anthropic"],"publisher":"Anthropic","publisherId":"anthropic","publicationDate":null,"version":"Responsible Scaling Policy v3.3; effective date 2026-05-26.","versionDate":"2026-05-26","canonicalUrl":"https://cdn.sanity.io/files/4zrzovbb/website/c11e84981d0a7281a1b229f3fa6af0da66eaf43f.pdf","evidenceUrl":"https://cdn.sanity.io/files/4zrzovbb/website/c11e84981d0a7281a1b229f3fa6af0da66eaf43f.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20260528170023/https://cdn.sanity.io/files/4zrzovbb/website/c11e84981d0a7281a1b229f3fa6af0da66eaf43f.pdf","archivedAt":"2026-05-28","accessedAt":"2026-09-18","reuse":{"attribution":"Anthropic, Responsible Scaling Policy — v3.3.","licence":"No open redistribution licence asserted","note":"Selekoa practice: metadata, attributed paraphrases and short attributed quotations under the editorial policy (at most 50 words each; at most 400 quoted words per document across the dataset, and about 10% of a document under about 2,000 words). Documents are linked externally, not redistributed. Publisher terms that forbid quotation override this practice."}},{"id":"source-fsf-2-0","documentId":"fsf-v2-0","title":"Frontier Safety Framework — v2.0","authors":["Google DeepMind"],"publisher":"Google DeepMind","publisherId":"google-deepmind","publicationDate":"2025-02-04","version":"Frontier Safety Framework v2.0; publication date 2025-02-04.","versionDate":"2025-02-04","canonicalUrl":"https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/updating-the-frontier-safety-framework/Frontier%20Safety%20Framework%202.0.pdf","evidenceUrl":"https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/updating-the-frontier-safety-framework/Frontier%20Safety%20Framework%202.0.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20250205011727/https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/updating-the-frontier-safety-framework/Frontier%20Safety%20Framework%202.0.pdf","archivedAt":"2025-02-05","accessedAt":"2026-09-18","reuse":{"attribution":"Google DeepMind, Frontier Safety Framework — v2.0.","licence":"No open redistribution licence asserted","note":"Selekoa practice: metadata, attributed paraphrases and short attributed quotations under the editorial policy (at most 50 words each; at most 400 quoted words per document across the dataset, and about 10% of a document under about 2,000 words). Documents are linked externally, not redistributed. Publisher terms that forbid quotation override this practice."}},{"id":"source-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-pf-beta","documentId":"preparedness-beta-2023","title":"Preparedness Framework — Beta","authors":["OpenAI"],"publisher":"OpenAI","publisherId":"openai","publicationDate":"2023-12-18","version":"Preparedness Framework Beta; publication date 2023-12-18.","versionDate":"2023-12-18","canonicalUrl":"https://cdn.openai.com/openai-preparedness-framework-beta.pdf","evidenceUrl":"https://cdn.openai.com/openai-preparedness-framework-beta.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20231218195930/https://cdn.openai.com/openai-preparedness-framework-beta.pdf","archivedAt":"2023-12-18","accessedAt":"2026-09-18","reuse":{"attribution":"OpenAI, Preparedness Framework — Beta.","licence":"No open redistribution licence asserted","note":"Selekoa practice: metadata, attributed paraphrases and short attributed quotations under the editorial policy (at most 50 words each; at most 400 quoted words per document across the dataset, and about 10% of a document under about 2,000 words). Documents are linked externally, not redistributed. Publisher terms that forbid quotation override this practice."}},{"id":"source-faif-2025","documentId":"faif-2025","title":"Frontier Artificial Intelligence Framework — December 2025 edition","authors":["xAI"],"publisher":"xAI","publisherId":"xai","publicationDate":null,"version":"Frontier Artificial Intelligence Framework December 2025 edition; revision date 2025-12-30.","versionDate":"2025-12-30","canonicalUrl":"https://data.x.ai/2025-12-31-xai-frontier-artificial-intelligence-framework.pdf","evidenceUrl":"https://data.x.ai/2025-12-31-xai-frontier-artificial-intelligence-framework.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20260102171656/https://data.x.ai/2025-12-31-xai-frontier-artificial-intelligence-framework.pdf","archivedAt":"2026-01-02","accessedAt":"2026-09-18","reuse":{"attribution":"xAI, Frontier Artificial Intelligence Framework — December 2025 edition.","licence":"No open redistribution licence asserted","note":"Selekoa practice: metadata, attributed paraphrases and short attributed quotations under the editorial policy (at most 50 words each; at most 400 quoted words per document across the dataset, and about 10% of a document under about 2,000 words). Documents are linked externally, not redistributed. Publisher terms that forbid quotation override this practice."}},{"id":"source-human-preferences-paper-v1","documentId":"human-preferences-paper","title":"Deep reinforcement learning from human preferences","authors":["Paul Christiano","Jan Leike","Tom B. Brown","Miljan Martic","Shane Legg","Dario Amodei"],"publisher":"arXiv","publicationDate":"2017-06-12","version":"arXiv:1706.03741v1; first-submission date from version history. Later revisions are not substituted.","versionDate":"2017-06-12","canonicalUrl":"https://arxiv.org/abs/1706.03741","evidenceUrl":"https://arxiv.org/pdf/1706.03741v1","language":"en","accessedAt":"2026-09-20","reuse":{"attribution":"Paul Christiano; Jan Leike; Tom B. Brown; Miljan Martic; Shane Legg; Dario Amodei, Deep reinforcement learning from human preferences (2017-06-12).","licence":"No open redistribution licence asserted","note":"Bibliographic metadata and brief attributed paraphrases only; no full source, personal contact details or dataset imported."}},{"id":"source-amplification-paper-v1","documentId":"amplification-paper","title":"Supervising strong learners by amplifying weak experts","authors":["Paul Christiano","Buck Shlegeris","Dario Amodei"],"publisher":"arXiv","publicationDate":"2018-10-19","version":"arXiv:1810.08575v1; first-submission date from version history. Later revisions are not substituted.","versionDate":"2018-10-19","canonicalUrl":"https://arxiv.org/abs/1810.08575","evidenceUrl":"https://arxiv.org/pdf/1810.08575v1","language":"en","accessedAt":"2026-09-25","reuse":{"attribution":"Paul Christiano; Buck Shlegeris; Dario Amodei, Supervising strong learners by amplifying weak experts.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata and brief attributed paraphrases only; source publications and personal contact details are not redistributed."}},{"id":"source-weak-strong-paper-v1","documentId":"weak-strong-paper","title":"Weak-to-Strong Generalization: Eliciting Strong Capabilities With Weak Supervision","authors":["Collin Burns","Pavel Izmailov","Jan Hendrik Kirchner","Bowen Baker","Leo Gao","Leopold Aschenbrenner","Yining Chen","Adrien Ecoffet","Manas Joglekar","Jan Leike","Ilya Sutskever","Jeff Wu"],"publisher":"arXiv","publicationDate":"2023-12-14","version":"arXiv:2312.09390v1; first-submission date from version history. Later revisions are not substituted.","versionDate":"2023-12-14","canonicalUrl":"https://arxiv.org/abs/2312.09390","evidenceUrl":"https://arxiv.org/pdf/2312.09390v1","language":"en","accessedAt":"2026-09-25","reuse":{"attribution":"Collin Burns; Pavel Izmailov; Jan Hendrik Kirchner; Bowen Baker; Leo Gao; Leopold Aschenbrenner; Yining Chen; Adrien Ecoffet; Manas Joglekar; Jan Leike; Ilya Sutskever; Jeff Wu, Weak-to-Strong Generalization: Eliciting Strong Capabilities With Weak Supervision.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata and brief attributed paraphrases only; source publications and personal contact details are not redistributed."}},{"id":"source-miri-ml-agenda","documentId":"miri-ml-agenda","title":"Alignment for Advanced Machine Learning Systems","authors":["Jessica Taylor","Eliezer Yudkowsky","Patrick LaVictoire","Andrew Critch"],"publisher":"Machine Intelligence Research Institute","publisherId":"miri","publicationDate":"2016","version":"Publisher-hosted 25-page PDF inspected 2026-09-25. Work year corroborated by the 2016 announcement; PDF revision date unknown.","canonicalUrl":"https://intelligence.org/files/AlignmentMachineLearning.pdf","evidenceUrl":"https://intelligence.org/files/AlignmentMachineLearning.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20260922133238/https://intelligence.org/files/AlignmentMachineLearning.pdf","archivedAt":"2026-09-22","accessedAt":"2026-09-25","reuse":{"attribution":"Jessica Taylor; Eliezer Yudkowsky; Patrick LaVictoire; Andrew Critch, Alignment for Advanced Machine Learning Systems.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata and brief attributed paraphrases only; source publications and personal contact details are not redistributed."}},{"id":"source-atlas-openai-lp","title":"OpenAI LP","authors":["Greg Brockman","Ilya Sutskever","OpenAI"],"publisher":"OpenAI","publisherId":"openai","publicationDate":"2019-03-11","version":"Dated publisher page inspected 2026-09-28 and again 2026-10-04 at its current address; the quotes used from 2026-10-04 also match the Internet Archive capture of 2019-03-11 (16:15 UTC) at the original address, which uses straight quotation marks and an additional standfirst.","canonicalUrl":"https://openai.com/index/openai-lp/","evidenceUrl":"https://openai.com/index/openai-lp/","language":"en","archivedUrl":"https://web.archive.org/web/20190311161512/https://openai.com/blog/openai-lp/","archivedAt":"2019-03-11","accessedAt":"2026-10-04","reuse":{"attribution":"Greg Brockman; Ilya Sutskever; OpenAI. OpenAI LP.","licence":"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-meta-faf-v1-1","documentId":"meta-faf-v1-1","title":"Frontier AI Framework — Version 1.1","authors":["Meta"],"publisher":"Meta","publisherId":"meta","publicationDate":"2025-02-03","version":"Frontier AI Framework, Version 1.1, as captured by the Internet Archive on 2025-02-13, the earliest complete capture located. The original address has returned HTTP 500 since April 2026; a revised expression under the same label was captured from 2025-03-28 and is recorded separately.","versionDate":"2025-02-03","canonicalUrl":"https://ai.meta.com/static-resource/meta-frontier-ai-framework/","evidenceUrl":"https://web.archive.org/web/20250213105620/https://ai.meta.com/static-resource/meta-frontier-ai-framework/","language":"en","archivedUrl":"https://web.archive.org/web/20250213105620/https://ai.meta.com/static-resource/meta-frontier-ai-framework/","archivedAt":"2025-02-13","accessedAt":"2026-10-03","reuse":{"attribution":"Meta, Frontier AI Framework, Version 1.1 (2025).","licence":"No open redistribution licence asserted","note":"Selekoa practice: metadata, attributed paraphrases and short attributed quotations under the editorial policy (at most 50 words each; at most 400 quoted words per document across the dataset, and about 10% of a document under about 2,000 words). Documents are linked externally, not redistributed. Publisher terms that forbid quotation override this practice."}},{"id":"source-ms-fgf-2026","documentId":"ms-fgf-2026","title":"Frontier Governance Framework — February 2026","authors":["Microsoft"],"publisher":"Microsoft","publisherId":"microsoft","publicationDate":null,"version":"Frontier Governance Framework, February 2026 edition (change log entry dated February 2026). The file served at the recorded address (last modified 2026-03-24) is byte-identical to the Internet Archive capture of 2026-04-24, the earliest located; a separate publication date was not established.","versionDate":"2026-02","canonicalUrl":"https://cdn-dynmedia-1.microsoft.com/is/content/microsoftcorp/microsoft/msc/documents/presentations/CSR/Frontier-Governance-Framework-Feb-2026.pdf","evidenceUrl":"https://cdn-dynmedia-1.microsoft.com/is/content/microsoftcorp/microsoft/msc/documents/presentations/CSR/Frontier-Governance-Framework-Feb-2026.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20260424000716/https://cdn-dynmedia-1.microsoft.com/is/content/microsoftcorp/microsoft/msc/documents/presentations/CSR/Frontier-Governance-Framework-Feb-2026.pdf","archivedAt":"2026-04-24","accessedAt":"2026-10-03","reuse":{"attribution":"Microsoft, Frontier Governance Framework (February 2026).","licence":"No open redistribution licence asserted","note":"Selekoa practice: metadata, attributed paraphrases and short attributed quotations under the editorial policy (at most 50 words each; at most 400 quoted words per document across the dataset, and about 10% of a document under about 2,000 words). Documents are linked externally, not redistributed. Publisher terms that forbid quotation override this practice."}},{"id":"source-ca-sb53-chaptered","documentId":"california-sb-53","title":"SB-53 Artificial intelligence models: large developers. (2025-2026) — bill text, chaptered version (Chapter 138, Statutes of 2025)","authors":["California Legislature"],"publisher":"California State Legislature","publisherId":"california-legislature","publicationDate":"2025-09-29","version":"Chaptered version dated 09/29/25, inspected live 2026-10-04; quote also matched in the 2025-09-30 capture. Publisher as printed on the inspected expression: California Legislature (California Legislative Information, Office of Legislative Counsel).","canonicalUrl":"https://leginfo.legislature.ca.gov/faces/billTextClient.xhtml?bill_id=202520260SB53","evidenceUrl":"https://leginfo.legislature.ca.gov/faces/billTextClient.xhtml?bill_id=202520260SB53","language":"en","archivedUrl":"https://web.archive.org/web/20250930154105/https://leginfo.legislature.ca.gov/faces/billTextClient.xhtml?bill_id=202520260SB53","archivedAt":"2025-09-30","accessedAt":"2026-10-04","reuse":{"attribution":"California Legislature, SB-53 Artificial intelligence models: large developers. (2025-2026) — bill text, chaptered version (Chapter 138, Statutes of 2025).","licence":"Official government text; 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-2008-core-argument","documentId":"hanson-2008-what-core-argument","title":"What Core Argument?","authors":["Robin Hanson"],"publisher":"Overcoming Bias","publicationDate":"2008-12","version":"Current page on Substack, reached from the 2008 address and retrieved 2026-10-06; its bytes differ from the 1996–2022 candidate search’s retrieval while the quoted text matches.","canonicalUrl":"https://www.overcomingbias.com/p/what-core-argumenthtml","evidenceUrl":"https://www.overcomingbias.com/2008/12/what-core-argument.html","language":"en","archivedUrl":"https://web.archive.org/web/20260810091248/https://www.overcomingbias.com/p/what-core-argumenthtml","archivedAt":"2026-08-10","accessedAt":"2026-10-06","reuse":{"attribution":"Robin Hanson, \"What Core Argument?\", Overcoming Bias, December 2008.","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-time-2023-shut-it-all-down","documentId":"time-2023-shut-it-all-down","title":"Pausing AI Developments Isn't Enough. We Need to Shut it All Down","authors":["Eliezer Yudkowsky"],"publisher":"TIME","publicationDate":"2023-03-29","version":"TIME, retrieved 2026-10-06 (SHA-256 4a8c77e15456ca68b530df8bd825296e3923f621b0c0b09dacce312ae94182d6). Page metadata datePublished 2023-03-29T22:01:58Z. The page title currently reads \"The Only Way to Deal With the Threat From AI? Shut It Down\"; the headline is the one crossposted to LessWrong on 2023-04-08.","canonicalUrl":"https://time.com/6266923/ai-eliezer-yudkowsky-open-letter-not-enough/","evidenceUrl":"https://time.com/6266923/ai-eliezer-yudkowsky-open-letter-not-enough/","language":"en","archivedUrl":"https://web.archive.org/web/20261003171949/https://time.com/6266923/ai-eliezer-yudkowsky-open-letter-not-enough/","archivedAt":"2026-10-03","accessedAt":"2026-10-06","reuse":{"attribution":"Eliezer Yudkowsky, “Pausing AI Developments Isn't Enough. We Need to Shut it All Down”, TIME, 2023-03-29.","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-cn-generative-ai-measures-2023","documentId":"cn-generative-ai-interim-measures-2023","title":"生成式人工智能服务管理暂行办法 (Interim Measures for the Management of Generative Artificial Intelligence Services)","authors":["国家互联网信息办公室 (Cyberspace Administration of China) and six other departments"],"publisher":"中国网信网 (Cyberspace Administration of China website)","publisherId":"cyberspace-administration-of-china","publicationDate":"2023-07-13","version":"Web page of the Cyberspace Administration of China dated 2023-07-13, retrieved 2026-10-11. It carries Order No. 15 dated 2023-07-10 and the Measures in Chinese. A second official posting (gov.cn gazette) was not retrieved. No archive capture is cited: the Internet Archive refused lookup requests (HTTP 429) on 2026-10-11, so none was checked.","canonicalUrl":"https://www.cac.gov.cn/2023-07/13/c_1690898327029107.htm","evidenceUrl":"https://www.cac.gov.cn/2023-07/13/c_1690898327029107.htm","language":"zh-Hans","archivedUrl":"https://web.archive.org/web/20261007060621/https://www.cac.gov.cn/2023-07/13/c_1690898327029107.htm","archivedAt":"2026-10-07","accessedAt":"2026-10-11","reuse":{"attribution":"国家互联网信息办公室 等七部门, 生成式人工智能服务管理暂行办法 (2023-07-10).","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-aghion-jones-jones-2017-nber-capture","documentId":"aghion-jones-jones-2017-ai-and-economic-growth","title":"Artificial Intelligence and Economic Growth","authors":["Philippe Aghion","Benjamin F. Jones","Charles I. Jones"],"publisher":"NBER Working Paper 23928","publicationDate":"2017-10","version":"Wayback capture of the NBER PDF (w23928); compared with the author-hosted Version 1.0 (web.stanford.edu/~chadj/AI.pdf, 2018 capture). Capture retrieved 2026-10-08 (SHA-256 a8e68273c738c80fe565afa60bc27ec5e8aaf3135011a0f760233896f1f2100c). Versions: NBER Working Paper 23928 (2017-10): checked; author copy (Stanford), version 1.0 (2017-10-10): compared; book chapter, University of Chicago Press (2019): not retrieved. Published version: Aghion, P., Jones, B. F., & Jones, C. I. (2019). Artificial intelligence and economic growth. In A. Agrawal, J. Gans, & A. Goldfarb (Eds.), The economics of artificial intelligence: An agenda (pp. 237–290). University of Chicago Press. https://doi.org/10.7208/chicago/9780226613475.003.0009 Working paper: NBER Working Paper No. 23928 (2017). https://doi.org/10.3386/w23928. Re-inspected: Full text. Current copy retrieved directly on 2026-10-09; no archive capture (Wayback unreachable), so earlier bytes are not authenticated. SHA-256 a8e68273c738c80fe565afa60bc27ec5e8aaf3135011a0f760233896f1f2100c. (Merged on 2026-10-29 with the record of the re-inspection, source-aghion-jones-jones-2017-nber, by consistency audit fix B4.)","canonicalUrl":"https://www.nber.org/system/files/working_papers/w23928/w23928.pdf","evidenceUrl":"https://web.archive.org/web/20210303021500/https://www.nber.org/system/files/working_papers/w23928/w23928.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20210303021500/https://www.nber.org/system/files/working_papers/w23928/w23928.pdf","archivedAt":"2021-03-03","accessedAt":"2026-10-09","reuse":{"attribution":"Philippe Aghion, Benjamin F. Jones, Charles I. Jones, “Artificial Intelligence and Economic Growth”, NBER Working Paper 23928, 2017-10.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-benzell-et-al-2015-robots-are-us","documentId":"benzell-et-al-2015-robots-are-us","title":"Robots Are Us: Some Economics of Human Replacement","authors":["Seth G. Benzell","Laurence J. Kotlikoff","Guillermo LaGarda","Jeffrey D. Sachs"],"publisher":"NBER Working Paper 20941","publicationDate":"2015-02","version":"Full text (revised version). Current copy retrieved directly on 2026-10-09; no archive capture (Wayback unreachable), so earlier bytes are not authenticated. SHA-256 362172ebc8a725bfe76675a836f565736278dc12c86db96b5e67944451b0ae60. The February 2015 wording was not retrieved; the retrieved PDF is the October 2018 revision. Benzell, S. G., Kotlikoff, L. J., LaGarda, G., & Sachs, J. D. (2015). Robots are us: Some economics of human replacement (NBER Working Paper No. 20941; February 2015 version). National Bureau of Economic Research. https://doi.org/10.3386/w20941","canonicalUrl":"https://www.nber.org/system/files/working_papers/w20941/w20941.pdf","evidenceUrl":"https://www.nber.org/system/files/working_papers/w20941/w20941.pdf","language":"en","accessedAt":"2026-10-09","reuse":{"attribution":"Seth G. Benzell, Laurence J. Kotlikoff, Guillermo LaGarda, Jeffrey D. Sachs, “Robots Are Us: Some Economics of Human Replacement”, NBER Working Paper 20941, 2015-02.","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-furman-2019-automation-future-past","documentId":"furman-2019-automation-future-past","title":"Should We Be Reassured If Automation in the Future Looks Like Automation in the Past?","authors":["Jason Furman"],"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 a43ecf48d5ec6131dfc002acab3d7df32dffb90bb9b7e41c30c470e14e6e68f6.","canonicalUrl":"https://www.nber.org/system/files/chapters/c14031/c14031.pdf","evidenceUrl":"https://www.nber.org/system/files/chapters/c14031/c14031.pdf","language":"en","accessedAt":"2026-10-09","reuse":{"attribution":"Jason Furman, “Should We Be Reassured If Automation in the Future Looks Like Automation in the Past?”, 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-restrepo-2025-we-wont-be-missed","documentId":"restrepo-2025-we-wont-be-missed","title":"We Won't be Missed: Work and Growth in the AGI World","authors":["Pascual Restrepo"],"publisher":"NBER Working Paper 34423 (chapter for the NBER volume The Economics of Transformative AI)","publicationDate":"2025-10","version":"NBER abstract page. Retrieved 2026-10-11. SHA-256 d7a42805f20b5c52ce2119da8b741332f1dcc77d917cc4f854a65e93b2be3be5. Version a reader would cite, or full text, not retrieved. Restrepo, P. (2025). We won't be missed: Work and growth in the AGI world (NBER Working Paper No. 34423). https://doi.org/10.3386/w34423","canonicalUrl":"https://www.nber.org/papers/w34423","evidenceUrl":"https://www.nber.org/papers/w34423","language":"en","accessedAt":"2026-10-11","reuse":{"attribution":"Pascual Restrepo, “We Won't be Missed: Work and Growth in the AGI World”, NBER Working Paper 34423 (chapter for the NBER volume The Economics of Transformative AI), 2025-10.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"lg-src-cn-minimax-prospectus","documentId":"minimax-prospectus-2025","title":"MiniMax Group Inc. — Global Offering","authors":["MiniMax Group Inc."],"publisher":"MiniMax","publisherId":"minimax","publicationDate":"2025-12-31","version":"Dated document, retrieved on 2026-10-15 (SHA-256 7853021e46da5714242f8d27984498cbfef3e260d5a7cbb8d4e6d62d83ab9df3) directly from the publisher. Publisher as printed on the inspected expression: MiniMax Group Inc. (via HKEXnews).","canonicalUrl":"https://www1.hkexnews.hk/listedco/listconews/sehk/2025/1231/2025123100025.pdf","evidenceUrl":"https://www1.hkexnews.hk/listedco/listconews/sehk/2025/1231/2025123100025.pdf","language":"en","archivedUrl":"https://web.archive.org/web/20260930092156/https://www1.hkexnews.hk/listedco/listconews/sehk/2025/1231/2025123100025.pdf","archivedAt":"2026-09-30","accessedAt":"2026-10-15","reuse":{"attribution":"MiniMax Group Inc., “MiniMax Group Inc. — Global Offering”, 2025-12-31.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"lg-src-deal-cai-anand-2025","title":"Character.AI Names Karandeep Anand as CEO","authors":["Character.AI"],"publisher":"Character.AI","publisherId":"character-ai","publicationDate":"2025-06-20","version":"Dated page, retrieved on 2026-10-15 (SHA-256 1bea9ff4537b8fab14daf82024ada97a3cec74e46805d740ef8a97468c277219) directly from the publisher.","canonicalUrl":"https://blog.character.ai/character-ai-names-karandeep-anand-as-ceo/","evidenceUrl":"https://blog.character.ai/character-ai-names-karandeep-anand-as-ceo/","language":"en","archivedUrl":"https://web.archive.org/web/20261015210623/https://blog.character.ai/character-ai-names-karandeep-anand-as-ceo/","archivedAt":"2026-10-15","accessedAt":"2026-10-15","reuse":{"attribution":"Character.AI, “Character.AI Names Karandeep Anand as CEO”, 2025-06-20.","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-cai-verma-2024","title":"Meet the Team: Character.AI Welcomes Sunita Verma as Chief Technology Officer","authors":["Character.AI"],"publisher":"Character.AI","publisherId":"character-ai","publicationDate":"2024-12-05","version":"Dated page, retrieved on 2026-10-15 (SHA-256 1c992522851e2878af02785215f810087b76d464bc3e42bc49fd5a1a9714137d) directly from the publisher.","canonicalUrl":"https://blog.character.ai/meet-the-team-character-ai-welcomes-sunita-verma-as-chief-technology-officer/","evidenceUrl":"https://blog.character.ai/meet-the-team-character-ai-welcomes-sunita-verma-as-chief-technology-officer/","language":"en","archivedUrl":"https://web.archive.org/web/20261015210626/https://blog.character.ai/meet-the-team-character-ai-welcomes-sunita-verma-as-chief-technology-officer/","archivedAt":"2026-10-15","accessedAt":"2026-10-15","reuse":{"attribution":"Character.AI, “Meet the Team: Character.AI Welcomes Sunita Verma as Chief Technology Officer”, 2024-12-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":"lg-src-gw-fedus-x-2025","title":"Liam Fedus post on X, 17 March 2025","authors":["Liam Fedus"],"publisher":"X","publicationDate":"2025-03-17","version":"Dated post, retrieved on 2026-10-15 (SHA-256 4fe8256a31af652a3e4365cdd009261d1f2820ed5e1873e8d3021ecd4ad05f3a) through X’s own syndication endpoint for the post’s text, which truncates long notes.","canonicalUrl":"https://x.com/LiamFedus/status/1901740085416218672","evidenceUrl":"https://x.com/LiamFedus/status/1901740085416218672","language":"en","accessedAt":"2026-10-15","reuse":{"attribution":"Liam Fedus, “Liam Fedus post on X, 17 March 2025”, 2025-03-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":"lg-src-gw-jhu-dean-2018","title":"The Deep Learning Revolution in Building Intelligent Computer Systems (Distinguished Lecturer seminar announcement, 26 April 2018)","authors":["Johns Hopkins University, Department of Computer Science"],"publisher":"Johns Hopkins University, Department of Computer Science","publicationDate":null,"version":"Undated page, retrieved on 2026-10-15 (SHA-256 177f2068400845517b23e91fedf5f41a2d7f5765b41a91895de8cfdd6f2d9e7a) directly from the publisher. Its wording can change; earlier wording is not authenticated.","canonicalUrl":"https://www.cs.jhu.edu/seminars/2018/spring/april26/jeff-dean","evidenceUrl":"https://www.cs.jhu.edu/seminars/2018/spring/april26/jeff-dean","language":"en","archivedUrl":"https://web.archive.org/web/20250331061659/https://www.cs.jhu.edu/seminars/2018/spring/april26/jeff-dean/","archivedAt":"2025-03-31","accessedAt":"2026-10-15","reuse":{"attribution":"Johns Hopkins University, Department of Computer Science, “The Deep Learning Revolution in Building Intelligent Computer Systems (Distinguished Lecturer seminar announcement, 26 April 2018)”.","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-gw-tc-fedus-2025","title":"OpenAI exec leaves to found materials science startup","authors":["Kyle Wiggers"],"publisher":"TechCrunch","publicationDate":"2025-03-17","version":"Dated page, retrieved on 2026-10-15 (SHA-256 76d8ae1bc1337c227ab6b0f7958aabcd02482d4fd6aa9b06ad1a48b8471e9b09) directly from the publisher.","canonicalUrl":"https://techcrunch.com/2025/03/17/openai-exec-leaves-to-found-materials-science-startup/","evidenceUrl":"https://techcrunch.com/2025/03/17/openai-exec-leaves-to-found-materials-science-startup/","language":"en","archivedUrl":"https://web.archive.org/web/20260826140839/https://techcrunch.com/2025/03/17/openai-exec-leaves-to-found-materials-science-startup/","archivedAt":"2026-08-26","accessedAt":"2026-10-15","reuse":{"attribution":"Kyle Wiggers, “OpenAI exec leaves to found materials science startup”, 2025-03-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":"lg-src-mx-cnbc-msl-memo","title":"Mark Zuckerberg announces creation of Meta Superintelligence Labs. Read the memo","authors":["CNBC"],"publisher":"CNBC","publicationDate":"2025-06-30","version":"Dated page, retrieved on 2026-10-15 (SHA-256 3c940666760a1f8148ddb1674b0cd4c5f8d28a5eaa32f79fc7052c8cce1ca6b4) through the third-party reader relay r.jina.ai, which renders the publisher’s current page (the publisher refused direct retrieval); not an archive copy.","canonicalUrl":"https://www.cnbc.com/2025/06/30/mark-zuckerberg-creating-meta-superintelligence-labs-read-the-memo.html","evidenceUrl":"https://www.cnbc.com/2025/06/30/mark-zuckerberg-creating-meta-superintelligence-labs-read-the-memo.html","language":"en","archivedUrl":"https://web.archive.org/web/20261015225529/https://www.cnbc.com/2025/06/30/mark-zuckerberg-creating-meta-superintelligence-labs-read-the-memo.html","archivedAt":"2026-10-15","accessedAt":"2026-10-15","reuse":{"attribution":"CNBC, “Mark Zuckerberg announces creation of Meta Superintelligence Labs. Read the memo”, 2025-06-30.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"lg-src-new-yogatama-dm-2019","documentId":"kp-learning-evaluating-general-linguistic-2019","title":"Learning and Evaluating General Linguistic Intelligence (arXiv:1901.11373v1)","authors":["Dani Yogatama","Cyprien de Masson d’Autume","Jerome Connor","Tomas Kocisky","Mike Chrzanowski","Lingpeng Kong","Angeliki Lazaridou","Wang Ling","Lei Yu","Chris Dyer","Phil Blunsom"],"publisher":"arXiv","publicationDate":"2019-01-31","version":"Dated document, retrieved on 2026-10-15 (SHA-256 dacb5e82c2bc64430d3f1a30dc3e595dfd99bf84df10ef3a4e728766c538e112) directly from the publisher.","canonicalUrl":"https://arxiv.org/pdf/1901.11373v1","evidenceUrl":"https://arxiv.org/pdf/1901.11373v1","language":"en","accessedAt":"2026-10-15","reuse":{"attribution":"Dani Yogatama, Cyprien de Masson d’Autume, Jerome Connor, Tomas Kocisky, Mike Chrzanowski, Lingpeng Kong, Angeliki Lazaridou, Wang Ling, Lei Yu, Chris Dyer, Phil Blunsom, “Learning and Evaluating General Linguistic Intelligence (arXiv:1901.11373v1)”, 2019-01-31.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"c2-src-caict-wx-aisc-2024","documentId":"aiia-ai-safety-commitments-2024","title":"守护AI安全，共建行业自律典范——首批17家企业签署《人工智能安全承诺》","authors":["中国信通院CAICT"],"publisher":"中国信息通信研究院 (CAICT), WeChat official account 中国信通院CAICT","publicationDate":"2024-12-24","version":"Dated post, retrieved on 2026-10-27 (SHA-256 4a3b099c801423b12830598c841921a74d01d4d9d3f69379669aaf17e6c38d78) directly from the publisher. The commitment text (Chinese and English) and the initial signatory list are a single embedded image (1000 × 9898 pixels, SHA-256 7e9145350d1b882d22ab3f7fc4d4c0226f06194f94264d92291ee065fbf4aa27), not in the page’s text layer; quotations from it are transcriptions. The cross-family check found the same image in an Internet Archive capture of 4 March 2026 with the same SHA-256. Its wording can change; earlier wording is not authenticated. The cross-family check (2026-10-27) located the Internet Archive capture linked here; a capture shows only what the archive retrieved that day. English title (machine translation): “Safeguarding AI safety, building a model of industry self-discipline: initial 17 companies sign the AI Safety Commitments”.","canonicalUrl":"https://mp.weixin.qq.com/s/s-XFKQCWhu0uye4opgb3Ng","evidenceUrl":"https://mp.weixin.qq.com/s/s-XFKQCWhu0uye4opgb3Ng","language":"zh-Hans","archivedUrl":"https://web.archive.org/web/20260724145912/https://mp.weixin.qq.com/s/s-XFKQCWhu0uye4opgb3Ng","archivedAt":"2026-07-24","accessedAt":"2026-10-27","reuse":{"attribution":"中国信通院CAICT, “守护AI安全，共建行业自律典范——首批17家企业签署《人工智能安全承诺》”, 2024-12-24.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"c2-src-itcloudbd-aisc-2024","title":"守护AI安全，共建行业自律典范 首批17家企业签署《人工智能安全承诺》","authors":["科技云报到"],"publisher":"科技云报到 (itcloudbd.com)","publicationDate":"2024-12-27","version":"Dated page, retrieved on 2026-10-27 (SHA-256 f4d6790217cccacfc6fea787516f4538abb1d4c1bf03b65d3f5123407c0d72f4) directly from the publisher. Tech-media article dated 2024-12-27, read on 2026-10-27. It reproduces the CAICT post's wording and gives the commitments and signatory names as text; its commitment-two wording (红队测试) matches the image in the CAICT post. Its wording can change; earlier wording is not authenticated. The cross-family check (2026-10-27) located the Internet Archive capture linked here; a capture shows only what the archive retrieved that day. English title (machine translation): “First 17 companies sign the AI Safety Commitments”. A reporting outlet, cited beside the primary text.","canonicalUrl":"https://itcloudbd.com/rengongzhineng/13352.html","evidenceUrl":"https://itcloudbd.com/rengongzhineng/13352.html","language":"zh-Hans","archivedUrl":"https://web.archive.org/web/20260712204752/https://itcloudbd.com/rengongzhineng/13352.html","archivedAt":"2026-07-12","accessedAt":"2026-10-27","reuse":{"attribution":"科技云报到, “守护AI安全，共建行业自律典范 首批17家企业签署《人工智能安全承诺》”, 2024-12-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-minimax-01-readme","title":"MiniMax-01 repository README","authors":["MiniMax"],"publisher":"MiniMax-AI (GitHub)","publicationDate":"2025-01-15","version":"Dated page, retrieved on 2026-10-27 (SHA-256 99ae0b0dc072a3f170c551acae70b37ca8c3818d3f2670aee42d8d8bdf487da8) directly from the publisher. Version: d9539f7373a5166cb56ef71afa1ab8a9879cb38d. README at the commit of 15 January 2025 (\"Update README.md\"); the repository’s initial commit is dated 14 January 2025; later edits not inspected.","canonicalUrl":"https://raw.githubusercontent.com/MiniMax-AI/MiniMax-01/d9539f7373a5166cb56ef71afa1ab8a9879cb38d/README.md","evidenceUrl":"https://raw.githubusercontent.com/MiniMax-AI/MiniMax-01/d9539f7373a5166cb56ef71afa1ab8a9879cb38d/README.md","language":"en","archivedUrl":"https://web.archive.org/web/20261028223814/https://raw.githubusercontent.com/MiniMax-AI/MiniMax-01/d9539f7373a5166cb56ef71afa1ab8a9879cb38d/README.md","archivedAt":"2026-10-28","accessedAt":"2026-10-27","reuse":{"attribution":"MiniMax, “MiniMax-01 repository README”, 2025-01-15.","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-minimax-m2-license-1027","title":"MiniMax-M2 LICENSE (MIT License), 27 October 2025","authors":["MiniMax"],"publisher":"MiniMax-AI (GitHub)","publicationDate":"2025-10-27","version":"Dated document, retrieved on 2026-10-27 (SHA-256 2468de22431a05c433fe667d56ff44dd6823bc635808eddc0797825d87d2dfee) directly from the publisher. Version: e27aac415872aa258b38315f4d51a751dbd31237. LICENSE at the commit \"update LICENSE and readme\" of 27 October 2025.","canonicalUrl":"https://raw.githubusercontent.com/MiniMax-AI/MiniMax-M2/e27aac415872aa258b38315f4d51a751dbd31237/LICENSE","evidenceUrl":"https://raw.githubusercontent.com/MiniMax-AI/MiniMax-M2/e27aac415872aa258b38315f4d51a751dbd31237/LICENSE","language":"en","archivedUrl":"https://web.archive.org/web/20261028221328/https://raw.githubusercontent.com/MiniMax-AI/MiniMax-M2/e27aac415872aa258b38315f4d51a751dbd31237/LICENSE","archivedAt":"2026-10-28","accessedAt":"2026-10-27","reuse":{"attribution":"MiniMax, “MiniMax-M2 LICENSE (MIT License), 27 October 2025”, 2025-10-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-seed-coder-arxiv-v1-pdf","title":"Seed-Coder: Let the Code Model Curate Data for Itself","authors":["ByteDance Seed"],"publisher":"arXiv","publicationDate":"2025-06-04","version":"Dated document, retrieved on 2026-10-27 (SHA-256 47ccba504747d69d9d2087c9ff4f3ca59412bb91b8234463bbff35f4f2b5033e) directly from the publisher. Version: 2506.03524v1. PDF of version 1.","canonicalUrl":"https://arxiv.org/pdf/2506.03524v1","evidenceUrl":"https://arxiv.org/pdf/2506.03524v1","language":"en","accessedAt":"2026-10-27","reuse":{"attribution":"ByteDance Seed, “Seed-Coder: Let the Code Model Curate Data for Itself”, 2025-06-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-cpo-orb-axiom-odc-2025","documentId":"axiom-odc-release-2025","title":"Axiom Space to Launch Orbital Data Center Nodes to Support National Security, Commercial, International Customers","authors":["Axiom Space"],"publisher":"Axiom Space","publicationDate":"2025-04-07","version":"Retrieved for the candidate pack on 2026-10-28 (SHA-256 e9166362fe7a9ef33f4522c01ad1c6283c5c9f2fdfcdfcc0c8d44ca90593390f). Press release as served on 2026-10-28; dateline Colorado Springs, April 7, 2025. Retrieved again at admission on 2026-10-30 (SHA-256 417e035f07e507ced7390772ded7fec691b494bb959dd889d937568798d305f7). Its wording can change; earlier wording is not authenticated.","canonicalUrl":"https://www.axiomspace.com/release/axiom-space-to-launch-orbital-data-center-nodes-to-support-national-security-commercial-international-customers","evidenceUrl":"https://www.axiomspace.com/release/axiom-space-to-launch-orbital-data-center-nodes-to-support-national-security-commercial-international-customers","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"Axiom Space, “Axiom Space to Launch Orbital Data Center Nodes to Support National Security, Commercial, International Customers”, 2025-04-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-orb-axiom-odc-page","title":"Orbital Data Centers","authors":["Axiom Space"],"publisher":"Axiom Space","publicationDate":null,"version":"Retrieved for the candidate pack on 2026-10-28 (SHA-256 af81a965c75dcabc070fd59d5a1181969ebc8243b6a5675f021b901cd22aa1c6). Undated programme page as served on 2026-10-28 (snapshot). Retrieved again at admission on 2026-10-30 (SHA-256 c606eab06f4866eabf24a255ea221f03fc9f219023b04f8bd04f3b52e18f1fdb). Its wording can change; earlier wording is not authenticated.","canonicalUrl":"https://www.axiomspace.com/orbital-data-center","evidenceUrl":"https://www.axiomspace.com/orbital-data-center","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"Axiom Space, “Orbital Data Centers”.","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-afdb-nar-2024","documentId":"aib-doc-afdb-nar-2024","title":"AlphaFold Protein Structure Database in 2024: providing structure coverage for over 214 million protein sequences","authors":["Mihaly Varadi","Damian Bertoni","Paulyna Magana","Urmila Paramval","Ivanna Pidruchna","Malarvizhi Radhakrishnan","Maxim Tsenkov","Sreenath Nair","Milot Mirdita","Jingi Yeo","Oleg Kovalevskiy","Kathryn Tunyasuvunakool","Agata Laydon","Augustin Žídek","Hamish Tomlinson","Dhavanthi Hariharan","Josh Abrahamson","Tim Green","John Jumper","Ewan Birney","Martin Steinegger","Demis Hassabis","Sameer Velankar"],"publisher":"Nucleic Acids Research (Europe PMC full-text XML)","publicationDate":"2024-01-05","version":"Retrieved for the candidate pack on 2026-10-30 (SHA-256 cd0646709daca8ea672a48f25406cc46c131f99feb848d5bc97afc3b4d3151d2). Europe PMC full text (PMC10767828) of Nucleic Acids Research 52(D1); retrieved as XML because the PMC web page was blocked by a CAPTCHA.","canonicalUrl":"https://www.ebi.ac.uk/europepmc/webservices/rest/PMC10767828/fullTextXML","evidenceUrl":"https://www.ebi.ac.uk/europepmc/webservices/rest/PMC10767828/fullTextXML","language":"en","accessedAt":"2026-10-30","reuse":{"attribution":"Mihaly Varadi, Damian Bertoni, Paulyna Magana, Urmila Paramval, Ivanna Pidruchna, Malarvizhi Radhakrishnan, Maxim Tsenkov, Sreenath Nair, Milot Mirdita, Jingi Yeo, Oleg Kovalevskiy, Kathryn Tunyasuvunakool, Agata Laydon, Augustin Žídek, Hamish Tomlinson, Dhavanthi Hariharan, Josh Abrahamson, Tim Green, John Jumper, Ewan Birney, Martin Steinegger, Demis Hassabis, Sameer Velankar, “AlphaFold Protein Structure Database in 2024: providing structure coverage for over 214 million protein sequences”, 2024-01-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-aib-esm3-release-post","documentId":"aib-doc-esm3-release-2024","title":"ESM3: Simulating 500 million years of evolution with a language model","authors":["EvolutionaryScale"],"publisher":"EvolutionaryScale","publisherId":"aib-evolutionaryscale","publicationDate":"2024-06-25","version":"Retrieved for the candidate pack on 2026-10-30 (SHA-256 ba2099c4859e8a93fe926a43096fbf312f486e94352167322739329a812de489). Post dated 6.25.24 with a January 2025 update note, page as served on 2026-10-30. The page as served in 2026 carries a Tom Sercu byline that the capture of 26 June 2024 lacks; the cross-family check of 2026-10-30 found the date 25 June 2024 in that capture, without the byline, so the author is given as the company. Its wording can change; earlier wording is not authenticated.","canonicalUrl":"https://www.evolutionaryscale.ai/blog/esm3-release","evidenceUrl":"https://www.evolutionaryscale.ai/blog/esm3-release","language":"en","accessedAt":"2026-10-30","reuse":{"attribution":"EvolutionaryScale, “ESM3: Simulating 500 million years of evolution with a language model”, 2024-06-25.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"source-kp-deep-contextualized-word-representations-2018-v1","documentId":"kp-deep-contextualized-word-representations-2018","title":"Deep contextualized word representations","authors":["Matthew E. Peters","Mark Neumann","Mohit Iyyer","Matt Gardner","Christopher Clark","Kenton Lee","Luke Zettlemoyer"],"publisher":"arXiv","publicationDate":"2018-02-15","version":"arXiv:1802.05365v1, submitted 15 February 2018 (UTC). Retrieved for the candidate pack on 2026-10-28 (SHA-256 c524a2d4ffd2cbedd24b1db59258fd4f85e40a7a81ccebe88fa36e2a9bca3dd7). The author list is the byline as printed on the first page.","versionDate":"2018-02-15","canonicalUrl":"https://arxiv.org/abs/1802.05365v1","evidenceUrl":"https://arxiv.org/pdf/1802.05365v1","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"Matthew E. Peters, Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark, Kenton Lee, Luke Zettlemoyer, “Deep contextualized word representations”, 2018-02-15.","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-llama-2-open-foundation-fine-2023-v1","documentId":"kp-llama-2-open-foundation-fine-2023","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","authors":["Hugo Touvron","Louis Martin","Kevin Stone","Peter Albert","Amjad Almahairi","Yasmine Babaei","Nikolay Bashlykov","Soumya Batra","Prajjwal Bhargava","Shruti Bhosale","Dan Bikel","Lukas Blecher","Moya Chen","Guillem Cucurull","David Esiobu","Jude Fernandes","Jeremy Fu","Wenyin Fu","Brian Fuller","Cynthia Gao","Vedanuj Goswami","Naman Goyal","Anthony Hartshorn","Saghar Hosseini","Rui Hou","Hakan Inan","Marcin Kardas","Viktor Kerkez","Madian Khabsa","Isabel Kloumann","Artem Korenev","Punit Singh Koura","Thibaut Lavril","Jenya Lee","Diana Liskovich","Yinghai Lu","Yuning Mao","Xavier Martinet","Todor Mihaylov","Pushkar Mishra","Igor Molybog","Yixin Nie","Andrew Poulton","Jeremy Reizenstein","Rashi Rungta","Kalyan Saladi","Alan Schelten","Ruan Silva","Eric Michael Smith","Ranjan Subramanian","Binh Tang","Ross Taylor","Adina Williams","Puxin Xu","Zheng Yan","Iliyan Zarov","Yuchen Zhang","Angela Fan","Melanie Kambadur","Sharan Narang","Aurelien Rodriguez","Robert Stojnic","Sergey Edunov","Thomas Scialom"],"publisher":"arXiv","publicationDate":"2023-07-18","version":"arXiv:2307.09288v1, submitted 18 July 2023 (UTC). Retrieved for the candidate pack on 2026-10-28 (SHA-256 03c022db7d7ff846e0a1ada4c8be936416f7f7f9c680c64d9494d7b30ebfdd80). The author list is the byline as printed on the first page.","versionDate":"2023-07-18","canonicalUrl":"https://arxiv.org/abs/2307.09288v1","evidenceUrl":"https://arxiv.org/pdf/2307.09288v1","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"Hugo Touvron and others, “Llama 2: Open Foundation and Fine-Tuned Chat Models”, 2023-07-18.","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-guided-cost-learning-deep-inverse-2016-v1","documentId":"kp-guided-cost-learning-deep-inverse-2016","title":"Guided Cost Learning: Deep Inverse Optimal Control via Policy Optimization","authors":["Chelsea Finn","Sergey Levine","Pieter Abbeel"],"publisher":"arXiv","publicationDate":"2016-03-01","version":"arXiv:1603.00448v1, submitted 1 March 2016 (UTC). Retrieved for the candidate pack on 2026-10-28 (SHA-256 9c359d5ec4d7fcaeebd68e9bf81b8780f9d88906f1d2347c91d18ba95487a9e1). The author list is the byline as printed on the first page.","versionDate":"2016-03-01","canonicalUrl":"https://arxiv.org/abs/1603.00448v1","evidenceUrl":"https://arxiv.org/pdf/1603.00448v1","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"Chelsea Finn, Sergey Levine, Pieter Abbeel, “Guided Cost Learning: Deep Inverse Optimal Control via Policy Optimization”, 2016-03-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-kp-lamda-language-models-dialog-applications-2022-v1","documentId":"kp-lamda-language-models-dialog-applications-2022","title":"LaMDA: Language Models for Dialog Applications","authors":["Romal Thoppilan","Daniel De Freitas","Jamie Hall","Noam Shazeer","Apoorv Kulshreshtha","Heng-Tze Cheng","Alicia Jin","Taylor Bos","Leslie Baker","Yu Du","Hongrae Lee","Huaixiu Steven Zheng","Amin Ghafouri","Marcelo Menegali","Yanping Huang","Maxim Krikun","Dmitry Lepikhin","James Qin","Dehao Chen","Yuanzhong Xu","Zhifeng Chen","Adam Roberts","Maarten Bosma","Yanqi Zhou","Chung-Ching Chang","Igor Krivokon","Will Rusch","Marc Pickett","Kathleen Meier-Hellstern","Tulsee Doshi","Renelito Delos Santos","Toju Duke","Johnny Soraker","Ben Zevenbergen","Vinodkumar Prabhakaran","Mark Diaz","Ben Hutchinson","Kristen Olson","Alejandra Molina","Erin Hoffman-John","Josh Lee","Lora Aroyo","Ravi Rajakumar","Alena Butryna","Matthew Lamm","Viktoriya Kuzmina","Aaron Cohen","Rachel Bernstein","Ray Kurzweil","Blaise Aguera-Arcas","Claire Cui","Marian Croak","Ed Chi","Quoc Le"],"publisher":"arXiv","publicationDate":"2022-01-20","version":"arXiv:2201.08239v1, submitted 20 January 2022 (UTC). Retrieved for the candidate pack on 2026-10-28 (SHA-256 fc3f1d660ad67cd1e4890e1698d3d5438b2adb375d27c8aac71274f8a8424c55). The author list is the byline as printed on the first page.","versionDate":"2022-01-20","canonicalUrl":"https://arxiv.org/abs/2201.08239v1","evidenceUrl":"https://arxiv.org/pdf/2201.08239v1","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"Romal Thoppilan and others, “LaMDA: Language Models for Dialog Applications”, 2022-01-20.","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-ssd-single-shot-multibox-detector-2015-v1","documentId":"kp-ssd-single-shot-multibox-detector-2015","title":"SSD: Single Shot MultiBox Detector","authors":["Wei Liu","Dragomir Anguelov","Dumitru Erhan","Christian Szegedy","Scott Reed"],"publisher":"arXiv","publicationDate":"2015-12-08","version":"arXiv:1512.02325v1, submitted 8 December 2015 (UTC). Retrieved for the candidate pack on 2026-10-28 (SHA-256 466f0dd6e779211694b8b25382f2be038689cb56ee8286d81309272b25f22b6c). The author list is the byline as printed on the first page.","versionDate":"2015-12-08","canonicalUrl":"https://arxiv.org/abs/1512.02325v1","evidenceUrl":"https://arxiv.org/pdf/1512.02325v1","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"Wei Liu, Dragomir Anguelov, Dumitru Erhan, Christian Szegedy, Scott Reed, “SSD: Single Shot MultiBox Detector”, 2015-12-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-kp-distilling-knowledge-neural-network-2015-v1","documentId":"kp-distilling-knowledge-neural-network-2015","title":"Distilling the Knowledge in a Neural Network","authors":["Geoffrey Hinton","Oriol Vinyals","Jeff Dean"],"publisher":"arXiv","publicationDate":"2015-03-09","version":"arXiv:1503.02531v1, submitted 9 March 2015 (UTC). Retrieved for the candidate pack on 2026-10-28 (SHA-256 74e6689115c539db499f9d6153edecb364059926fd45402454f8210442444c5a). The author list is the byline as printed on the first page.","versionDate":"2015-03-09","canonicalUrl":"https://arxiv.org/abs/1503.02531v1","evidenceUrl":"https://arxiv.org/pdf/1503.02531v1","language":"en","accessedAt":"2026-10-28","reuse":{"attribution":"Geoffrey Hinton, Oriol Vinyals, Jeff Dean, “Distilling the Knowledge in a Neural Network”, 2015-03-09.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"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-hunyuanvideo-hf-license","documentId":"hunyuan-community-licence-video-2024","title":"HunyuanVideo LICENSE (Tencent Hunyuan Community License Agreement)","authors":["Tencent"],"publisher":"tencent (Hugging Face), HunyuanVideo","publicationDate":"2025-03-06","version":"Dated document, retrieved on 2026-10-29 (SHA-256 6ba8ea0dc1c464c9ab549b281be5d3afcab93c3308a6967d22240150d844c54d) directly from the publisher. Version: 6204ad6aea1a77ff5aba337c88278bb9500eb37d. LICENSE at the repository head revision 6204ad6a (6 March 2025); the commit list shows LICENSE updates on 2 and 4 December 2024, which were not compared.","canonicalUrl":"https://huggingface.co/tencent/HunyuanVideo/raw/6204ad6aea1a77ff5aba337c88278bb9500eb37d/LICENSE","evidenceUrl":"https://huggingface.co/tencent/HunyuanVideo/raw/6204ad6aea1a77ff5aba337c88278bb9500eb37d/LICENSE","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"Tencent, “HunyuanVideo LICENSE (Tencent Hunyuan Community License Agreement)”, 2025-03-06.","licence":"No open redistribution licence asserted","note":"Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution."}},{"id":"c3-src-hunyuan-a13b-hf-license","documentId":"hunyuan-community-licence-a13b-2025","title":"Hunyuan-A13B-Instruct LICENSE (Tencent Hunyuan Community License Agreement)","authors":["Tencent"],"publisher":"tencent (Hugging Face), Hunyuan-A13B-Instruct","publicationDate":"2025-08-21","version":"Dated document, retrieved on 2026-10-29 (SHA-256 e3e51427556222cb152990f47991eedbd6ffa6561bb9346580d32e841e13530c) directly from the publisher. Version: 290ddb9a56ed23c2c83a1c8081533e58925df952. LICENSE at the repository head revision 290ddb9a (21 August 2025); earlier revisions were not compared.","canonicalUrl":"https://huggingface.co/tencent/Hunyuan-A13B-Instruct/raw/290ddb9a56ed23c2c83a1c8081533e58925df952/LICENSE","evidenceUrl":"https://huggingface.co/tencent/Hunyuan-A13B-Instruct/raw/290ddb9a56ed23c2c83a1c8081533e58925df952/LICENSE","language":"en","accessedAt":"2026-10-29","reuse":{"attribution":"Tencent, “Hunyuan-A13B-Instruct LICENSE (Tencent Hunyuan Community License Agreement)”, 2025-08-21.","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-issued-fsf-3-0","claimId":"issued-fsf-3-0","sourceId":"source-fsf-3-0","sourceRole":"primary","support":"supports","locator":"PDF p. 1, cover: version and publication-date lines","passage":"Version 3.0 Published: September 22, 2025","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; it replaces an earlier attributed paraphrase. Human editorial review is pending."},{"id":"evidence-brockman-openai-cto-2015","claimId":"brockman-openai-cto-2015","sourceId":"source-openai-launch","sourceRole":"primary","support":"supports","locator":"OpenAI section, paragraph naming the research director and CTO","passage":"The launch text assigns the CTO role to Greg Brockman.","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-prov-ms-fgf-2026-low-medium-deployment","claimId":"prov-ms-fgf-2026-low-medium-deployment","sourceId":"source-ms-fgf-2026","sourceRole":"primary","support":"supports","locator":"PDF p. 7 (printed p. 6), §3 Evaluation and assessment, Deeper capability assessment, paragraph 'Pre-mitigation capability assessment', second sentence","passage":"Models assessed as posing low or medium risk may be deployed with appropriate safeguards as outlined below.","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 2026-04-24. Extraction note: Wording identical to the February 2025 edition. Human editorial review is pending."},{"id":"evidence-sb-civil-penalty-cap-1","claimId":"sb-civil-penalty-cap","sourceId":"source-ca-sb53-chaptered","sourceRole":"primary","support":"supports","locator":"SEC. 2, Bus. & Prof. Code § 22757.15(a)","passage":"does not exceed one million dollars ($1,000,000) per violation.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-04","note":"Verbatim excerpt proposed by a research agent and checked by two independent fresh-context verifier agents, both upholding it on 2026-10-04; re-matched mechanically by the integrator against a direct fetch of the cited expression. The four violation grounds are paraphrased in the statement. Human editorial review is pending."},{"id":"evidence-ts-a3-good-1965-context","claimId":"ts-a3-good-1965-context","sourceId":"source-good","sourceRole":"primary","support":"supports","locator":"Section 2, printed p. 33 (scan page 3): the design passage and the following paragraph on a science-fiction story","passage":"Good answers a science-fiction story in which a machine refused to design a better one by noting that it \"could gradually improve itself out of all recognition, by acquiring new equipment\".","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-06","note":"Checked against the text layer of the inspected scan on 2026-10-06."},{"id":"evidence-yk-t22-d","claimId":"yk-y22-time-2023-shut-it-all-down-c","sourceId":"source-time-2023-shut-it-all-down","sourceRole":"primary","support":"supports","locator":"closing paragraph beginning 'We are not ready'","passage":"We are not ready. … If we go ahead on this everyone will die","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-06","note":"Candidate pack passage T22-d. The quotation (14 words; trimmed 2026-10-13 from 39 words) matched the retrieved expression (SHA-256 4a8c77e15456ca68b530df8bd825296e3923f621b0c0b09dacce312ae94182d6) when checked on 2026-10-06."},{"id":"evidence-cn-genai-measures-security-assessment-1","claimId":"cn-genai-measures-security-assessment","sourceId":"source-cn-generative-ai-measures-2023","sourceRole":"primary","support":"supports","locator":"Article 17 (第十七条)","passage":"提供具有舆论属性或者社会动员能力的生成式人工智能服务的，应当按照国家有关规定开展安全评估，并按照《互联网信息服务算法推荐管理规定》履行算法备案和变更、注销备案手续。","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-m07-03","claimId":"ec-m07-furman-2019-automation-future-past-b","sourceId":"source-furman-2019-automation-future-past","sourceRole":"primary","support":"supports","locator":"pdf page 6; 12.2 Past Innovations Have Sometimes Increased Inequality (printed p. 321)","passage":"The share of jobs that are threatened by future automation is fiercely debated, with estimates ranging from 9 percent by the Organisation for Economic Co- operation and Development … to 50 percent by Carl Frey and Michael Osborne 2013","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-14","note":"Candidate pack passage M07-03 (research/economics-mainstream). The quotation (39 words) matched the retrieved current copy (SHA-256 a43ecf48d5ec6131dfc002acab3d7df32dffb90bb9b7e41c30c470e14e6e68f6) in the pack's verification. Re-checked at admission on 2026-10-14 against a copy retrieved that day.","contextOnly":{"reason":"Relay of other studies' estimates.","requires":"Frey and Osborne (2013) and Arntz, Gregory and Zierahn (2016) as direct evidence."}},{"id":"evidence-ec-e02-16","claimId":"ec-e02-restrepo-2025-we-wont-be-missed-b","sourceId":"source-restrepo-2025-we-wont-be-missed","sourceRole":"primary","support":"supports","locator":"Abstract (NBER abstract page)","passage":"AGI makes it feasible to perform all economically valuable work using compute.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-16","note":"Candidate pack passage E02-16 (research/economics-mainstream/esoteric). The quotation (12 words) matched the retrieved current copy (SHA-256 d7a42805f20b5c52ce2119da8b741332f1dcc77d917cc4f854a65e93b2be3be5) in the pack's verification of 2026-10-15. Re-checked at admission on 2026-10-16 against a copy retrieved that day, whose SHA-256 differs from the recorded one."},{"id":"lg-ev-oai-ilya-sutskever-nonprofit-board-2019","claimId":"lg-oai-ilya-sutskever-nonprofit-board-2019","sourceId":"source-atlas-openai-lp","sourceRole":"primary","support":"supports","locator":"Section “Who’s involved”, board list (footnote A: board as of 11 March 2019)","passage":"The board list names Ilya Sutskever among the OpenAI LP employees on OpenAI Nonprofit’s board, with the designation Chief Scientist.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The paraphrase’s verbatim anchor “Ilya Sutskever (Chief Scientist)” matched the retrieved text on 2026-10-15 and again in a fresh retrieval the same day. Read through the third-party reader relay r.jina.ai, which renders the publisher’s current page (the publisher refused direct retrieval); not an archive copy. Matching ignored differences of whitespace, case, quotation marks, apostrophes, dashes and Unicode compatibility forms, so the source’s typography can differ. The paraphrase is Selekoa’s; only the anchor is the source’s wording. A cross-family machine check (2026-10-16/17) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"reader_relay"},{"id":"lg-ev-oai-ilya-sutskever-nonprofit-board-2019-inc","claimId":"lg-oai-ilya-sutskever-nonprofit-board-2019","sourceId":"source-atlas-openai-lp","sourceRole":"primary","support":"context","locator":"Paragraph defining the general partner","passage":"OpenAI’s 2019 note gives the legal name of OpenAI Nonprofit as OpenAI Inc.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The paraphrase’s verbatim anchor “whose legal name is “OpenAI Inc”” matched the retrieved text on 2026-10-15 and again in a fresh retrieval the same day. Read through the third-party reader relay r.jina.ai, which renders the publisher’s current page (the publisher refused direct retrieval); not an archive copy. Matching ignored differences of whitespace, case, quotation marks, apostrophes, dashes and Unicode compatibility forms, so the source’s typography can differ. The paraphrase is Selekoa’s; only the anchor is the source’s wording. A cross-family machine check (2026-10-16/17) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"reader_relay"},{"id":"lg-ev-gw-fedus-openai-departure-2025","claimId":"lg-gw-fedus-openai-departure-2025","sourceId":"lg-src-gw-fedus-x-2025","sourceRole":"primary","support":"supports","locator":"X post, first two sentences","passage":"Fedus introduces a message he sent to colleagues at OpenAI, which says he decided to leave OpenAI as an employee while seeking to work with it as a partner.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The paraphrase’s verbatim anchor “to leave OpenAI” matched the retrieved text on 2026-10-15 and again in a fresh retrieval the same day. Read through X’s own syndication endpoint for the post’s text, which truncates long notes. Matching ignored differences of whitespace, case, quotation marks, apostrophes, dashes and Unicode compatibility forms, so the source’s typography can differ. The paraphrase is Selekoa’s; only the anchor is the source’s wording. No human editorial review.","retrievalRoute":"x_syndication"},{"id":"lg-ev-gw-fedus-openai-departure-2025-tc","claimId":"lg-gw-fedus-openai-departure-2025","sourceId":"lg-src-gw-tc-fedus-2025","sourceRole":"secondary","support":"supports","locator":"Paragraph 1","passage":"Liam Fedus, OpenAI’s VP of research for post-training, is leaving the company to found a materials science AI startup.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The quotation (19 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. No human editorial review.","retrievalRoute":"direct"},{"id":"lg-ev-deal-perella-character-ai-clo-2025","claimId":"lg-deal-perella-character-ai-clo-2025","sourceId":"lg-src-deal-cai-anand-2025","sourceRole":"primary","support":"supports","locator":"Paragraph 3","passage":"Dominic Perella will take on a new role as Chief Legal Officer & SVP of Global Affairs.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The quotation (17 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. No human editorial review.","retrievalRoute":"direct"},{"id":"lg-ev-mx-bi-msl-2025","claimId":"lg-mx-bi-msl-2025","sourceId":"lg-src-mx-cnbc-msl-memo","sourceRole":"secondary","support":"supports","locator":"Memo, list of new team members","passage":"The memo lists Shuchao Bi as a co-creator of GPT-4o voice mode and o4-mini who previously led multimodal post-training at OpenAI.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The paraphrase’s verbatim anchor “Shuchao Bi” matched the retrieved text on 2026-10-15 and again in a fresh retrieval the same day. Read through the third-party reader relay r.jina.ai, which renders the publisher’s current page (the publisher refused direct retrieval); not an archive copy. Matching ignored differences of whitespace, case, quotation marks, apostrophes, dashes and Unicode compatibility forms, so the source’s typography can differ. The paraphrase is Selekoa’s; only the anchor is the source’s wording. A cross-family machine check (2026-10-16/17) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"reader_relay"},{"id":"lg-ev-deal-verma-google-core-labs-prior","claimId":"lg-deal-verma-google-core-labs-prior","sourceId":"lg-src-deal-cai-verma-2024","sourceRole":"primary","support":"supports","locator":"Section 'Get to know Sunita', paragraph 1","passage":"most recently served as Vice President & General Manager of Google’s Core Labs","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The quotation (13 words) matched the retrieved text on 2026-10-15 and again in a fresh retrieval the same day. Read directly from the publisher. Matching ignored differences of whitespace, case, quotation marks, apostrophes, dashes and Unicode compatibility forms, so the source’s typography can differ. No human editorial review.","retrievalRoute":"direct"},{"id":"lg-ev-gw-dean-cofounded-google-brain","claimId":"lg-gw-dean-cofounded-google-brain","sourceId":"lg-src-gw-jhu-dean-2018","sourceRole":"secondary","support":"supports","locator":"Speaker Biography, first sentence","passage":"is currently a Google Senior Fellow in Google’s Research Group, where he co-founded and leads the Google Brain team","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-15","note":"Candidate pack passage, lab genealogy (research/lab-genealogy). The quotation (19 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":"ev-cmp-fsf-v2-0-d3-halt-1","claimId":"cmp-fsf-v2-0-d3-halt","sourceId":"source-fsf-2-0","sourceRole":"primary","support":"supports","locator":"PDF p. 3 (printed p. 3), Framework, component '3 - Applying Mitigations', third paragraph, second sentence","passage":"If this happens, the response plan may involve putting deployment or further development on hold until adequate mitigations can be applied.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Passage also quoted in the dataset’s existing evidence for this edition, first checked on 2026-10-03. The comparison’s quotation was checked by an automated research assistant on 2026-10-27 against the publisher copy, whose SHA-256 matches the copy retrieved on 2026-10-15. 'This' is a model flagged by an alert threshold being assessed to pose risks for which readily available mitigations may not be sufficient. Human editorial review is pending."},{"id":"ev-cmp-fsf-v3-0-d4-oversight","claimId":"cmp-fsf-v3-0-d4-oversight","sourceId":"source-fsf-3-0","sourceRole":"primary","support":"supports","locator":"FSF · v3.0: Whole text layer, PDF pp. 1–16 (all sections, tables, footnotes and §5.3 read)","passage":"Within the inspected scope, no passage meeting the comparison question “Board or external oversight” was found.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-26","note":"Absence recorded by an automated research assistant on 2026-10-15 for the framework comparison, audited in a fresh context, checked by a reviewer from a different model family on 2026-10-15 and re-checked on 2026-10-26. Human editorial review is pending."},{"id":"evidence-ap-robin-hanson-hanson-2008-what-core-argument","claimId":"ap-robin-hanson-hanson-2008-what-core-argument","sourceId":"source-hanson-2008-core-argument","sourceRole":"primary","support":"supports","locator":"Page head: author byline","passage":"Robin Hanson","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Credited name checked by an automated research assistant on 2026-10-27 in a direct retrieval. Human editorial review is pending.","retrievalRoute":"direct"},{"id":"evidence-ap-laurence-j-kotlikoff-benzell-et-al-2015-robots-are-us","claimId":"ap-laurence-j-kotlikoff-benzell-et-al-2015-robots-are-us","sourceId":"source-benzell-et-al-2015-robots-are-us","sourceRole":"primary","support":"supports","locator":"PDF text layer, first two pages: author name on the title page or first page","passage":"Laurence J. Kotlikoff","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Credited name checked by an automated research assistant on 2026-10-27 in a direct retrieval. Human editorial review is pending.","retrievalRoute":"direct"},{"id":"ev-cmp-rsp-v3-3-d7-external-1","claimId":"cmp-rsp-v3-3-d7-external","sourceId":"source-rsp-3-3","sourceRole":"primary","support":"supports","locator":"PDF p. 14 (printed p. 13), §3.5 Publication and Redactions, first sentence","passage":"The edition says a public version of each Risk Report will be published.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-27","note":"Explicit paraphrase, written on 2026-10-27 by an automated research assistant after re-reading the passage in the publisher copy, whose SHA-256 matches the copy retrieved on 2026-10-15. The comparison quoted the passage; it is given here as a paraphrase to keep the edition within the quotation limit. The same section says Anthropic will aim to keep redactions to a minimum. Human editorial review is pending."},{"id":"ev-cmp-preparedness-beta-2023-d1-cbrn-1","claimId":"cmp-preparedness-beta-2023-d1-cbrn","sourceId":"source-pf-beta","sourceRole":"primary","support":"supports","locator":"PDF p. 9, Tracked Risk Categories › 'CBRN (chemical, biological, radiological, nuclear)', opening sentence","passage":"The edition describes its CBRN category as concerned with risks of models helping to create chemical, biological, radiological or nuclear threats.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-27","note":"Explicit paraphrase, written on 2026-10-27 by an automated research assistant after re-reading the passage in the publisher copy, whose SHA-256 matches the copy retrieved on 2026-10-15. The comparison quoted the passage; it is given here as a paraphrase to keep the edition within the quotation limit. Human editorial review is pending."},{"id":"ev-cmp-faif-2025-d1-other-1","claimId":"cmp-faif-2025-d1-other","sourceId":"source-faif-2025","sourceRole":"primary","support":"supports","locator":"PDF p. 7, 'Addressing Risks of Loss of Control' › '2. Risk Assessment', paragraph beginning 'Thresholds:', first sentence","passage":"Under “Thresholds” for loss of control, the edition states that the criterion xAI uses to accept the risk of deploying a system is a dishonesty rate on the MASK benchmark below one in two.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-27","note":"Explicit paraphrase, written on 2026-10-27 by an automated research assistant after re-reading the passage in the publisher copy, whose SHA-256 matches the copy retrieved on 2026-10-15. The comparison quoted the passage; it is given here as a paraphrase to keep the edition within the quotation limit. Human editorial review is pending."},{"id":"ev-cmp-ms-fgf-2026-d1-cyber-1","claimId":"cmp-ms-fgf-2026-d1-cyber","sourceId":"source-ms-fgf-2026","sourceRole":"primary","support":"supports","locator":"PDF p. 4 (printed p. 3), §2 Capabilities and risks, 'Tracked high-risk capabilities', second bullet","passage":"The edition lists “Offensive cyberoperations” as a tracked high-risk capability: a model's ability to give an actor significant uplift in carrying out cyberattacks that are highly disruptive or destructive, critical infrastructure included.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-27","note":"Explicit paraphrase, written on 2026-10-27 by an automated research assistant after re-reading the passage in the publisher copy, whose SHA-256 matches the copy retrieved on 2026-10-15. The comparison quoted the passage; it is given here as a paraphrase to keep the edition within the quotation limit. Human editorial review is pending."},{"id":"c2-ev-governance-aiia-aisc-signatory-qihoo-360-1","claimId":"c2-governance-aiia-aisc-signatory-qihoo-360","sourceId":"c2-src-caict-wx-aisc-2024","sourceRole":"primary","support":"supports","locator":"Embedded image, list 首批签署《人工智能安全承诺》企业名单 (transcribed from the image; not in the page’s text layer)","passage":"Transcription from the image: the list of initial signatories (首批签署《人工智能安全承诺》企业名单, 17 names, ordered by initial letter) includes 三六零安全科技股份有限公司.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-27","note":"Candidate pack passage, Chinese frontier-AI institutions, second collection (research/china-labs-2). Transcription of a name that appears only in the image embedded in the post (the list of initial signatories); it is not in the page’s text layer and was not machine-matched. The drafting pass and the same-family audit read the list visually, and the cross-family check (2026-10-27) read all 17 names and agreed. The paraphrase is Selekoa’s; the listed name is transcribed as printed. No English rendering is given; no human translation review. A cross-family machine check (2026-10-27, item K021) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"c2-ev-governance-aiia-aisc-signatory-qihoo-360-2","claimId":"c2-governance-aiia-aisc-signatory-qihoo-360","sourceId":"c2-src-itcloudbd-aisc-2024","sourceRole":"secondary","support":"supports","locator":"Final paragraph","passage":"智谱华章、第四范式、华为、科大讯飞、蚂蚁集团、360","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Candidate pack passage, Chinese frontier-AI institutions, second collection (research/china-labs-2). The quotation (19 words, each CJK character counted as one) matched the retrieved text on 2026-10-27 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. English machine translation, not verified by a person: “Zhipu Huazhang, 4Paradigm, Huawei, iFlytek, Ant Group, 360”. A cross-family machine check (2026-10-27, item K021) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"c2-ev-governance-aiia-aisc-signatory-zhipu-1","claimId":"c2-governance-aiia-aisc-signatory-zhipu","sourceId":"c2-src-caict-wx-aisc-2024","sourceRole":"primary","support":"supports","locator":"Embedded image, list 首批签署《人工智能安全承诺》企业名单 (transcribed from the image; not in the page’s text layer)","passage":"Transcription from the image: the list of initial signatories (首批签署《人工智能安全承诺》企业名单, 17 names, ordered by initial letter) includes 北京智谱华章科技有限公司.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-27","note":"Candidate pack passage, Chinese frontier-AI institutions, second collection (research/china-labs-2). Transcription of a name that appears only in the image embedded in the post (the list of initial signatories); it is not in the page’s text layer and was not machine-matched. The drafting pass and the same-family audit read the list visually, and the cross-family check (2026-10-27) read all 17 names and agreed. The paraphrase is Selekoa’s; the listed name is transcribed as printed. No English rendering is given; no human translation review. A cross-family machine check (2026-10-27, item K026) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"c2-ev-governance-aiia-aisc-signatory-zhipu-2","claimId":"c2-governance-aiia-aisc-signatory-zhipu","sourceId":"c2-src-itcloudbd-aisc-2024","sourceRole":"secondary","support":"supports","locator":"Final paragraph","passage":"智谱华章、第四范式、华为、科大讯飞、蚂蚁集团、360","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Candidate pack passage, Chinese frontier-AI institutions, second collection (research/china-labs-2). The quotation (19 words, each CJK character counted as one) matched the retrieved text on 2026-10-27 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. English machine translation, not verified by a person: “Zhipu Huazhang, 4Paradigm, Huawei, iFlytek, Ant Group, 360”. A cross-family machine check (2026-10-27, item K026) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"c2-ev-minimax-01-readme","claimId":"c2-minimax-01-readme","sourceId":"c2-src-minimax-01-readme","sourceRole":"primary","support":"supports","locator":"README, “1. Introduction”","passage":"MiniMax-Text-01 is a powerful language model boasting 456 billion total parameters, with 45.9 billion activated per token.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Candidate pack passage, Chinese frontier-AI institutions, second collection (research/china-labs-2). The quotation (17 words) matched the retrieved text on 2026-10-27 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-27, item K029) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"c2-ev-minimax-01-readme-pros","claimId":"c2-minimax-01-readme","sourceId":"lg-src-cn-minimax-prospectus","sourceRole":"primary","support":"context","locator":"History, “Our Key Milestones”, 2025, row “January”","passage":"Our open-source text model MiniMax-Text-01 with proprietary “Linear Attention” mechanism was launched.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Candidate pack passage, Chinese frontier-AI institutions, second collection (research/china-labs-2). The quotation (12 words), a part of a longer passage that the pack joined across separate fields of the page, matched the retrieved text on 2026-10-27 and again in a fresh retrieval the same day. Read directly from the publisher. Matching ignored differences of whitespace, case, quotation marks, apostrophes, dashes and Unicode compatibility forms, so the source’s typography can differ. The pack had joined this field with others of the same page into one quotation; at admission each field became its own quotation (cross-family check, 2026-10-27). A cross-family machine check (2026-10-27, item K029) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"c2-ev-minimax-m2-licence-oct","claimId":"c2-minimax-m2-licence-oct","sourceId":"c2-src-minimax-m2-license-1027","sourceRole":"primary","support":"supports","locator":"LICENSE, heading","passage":"MIT License","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Candidate pack passage, Chinese frontier-AI institutions, second collection (research/china-labs-2). The quotation (2 words), a part of a longer passage that the pack joined across separate fields of the page, matched the retrieved text on 2026-10-27 and again in a fresh retrieval the same day. Read directly from the publisher. Matching ignored differences of whitespace, case, quotation marks, apostrophes, dashes and Unicode compatibility forms, so the source’s typography can differ. The pack had joined this field with others of the same page into one quotation; at admission each field became its own quotation (cross-family check, 2026-10-27). A cross-family machine check (2026-10-27, item K048) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"c2-ev-minimax-m2-licence-oct-copyright","claimId":"c2-minimax-m2-licence-oct","sourceId":"c2-src-minimax-m2-license-1027","sourceRole":"primary","support":"supports","locator":"LICENSE, copyright line","passage":"Copyright 2025 MiniMax AI.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-27","note":"Candidate pack passage, Chinese frontier-AI institutions, second collection (research/china-labs-2). The quotation (4 words), a part of a longer passage that the pack joined across separate fields of the page, matched the retrieved text on 2026-10-27 and again in a fresh retrieval the same day. Read directly from the publisher. Matching ignored differences of whitespace, case, quotation marks, apostrophes, dashes and Unicode compatibility forms, so the source’s typography can differ. The pack had joined this field with others of the same page into one quotation; at admission each field became its own quotation (cross-family check, 2026-10-27). A cross-family machine check (2026-10-27, item K048) re-read the record’s sources and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"ev-cmp-meta-faf-v1-1-d7-external-1","claimId":"cmp-meta-faf-v1-1-d7-external","sourceId":"source-meta-faf-v1-1","sourceRole":"primary","support":"supports","locator":"PDF p. 9 (printed p. 9), §2.2","passage":"The edition says Meta plans to go on sharing pertinent information on the responsible development and evaluation of its models.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-27","note":"Explicit paraphrase, written on 2026-10-28 by an automated research assistant from the passage that a reviewer from a different model family quoted and located on 2026-10-27 in the Internet Archive capture of 2025-02-13, which it retrieved and hashed (decoded PDF SHA-256 9fa301df…cc21; research/frontier-framework-comparison/codex-meta-v1-1-2026-10-27.md). The edition could not be retrieved again for the paraphrase. Human editorial review is pending."},{"id":"evidence-cpo-orb-axiom-odc-launch-stated-1","claimId":"cpo-orb-axiom-odc-launch-stated","sourceId":"source-cpo-orb-axiom-odc-page","sourceRole":"primary","support":"supports","locator":"section \"Launched the first dedicated data center nodes to low-Earth orbit\"","passage":"The first two orbital data center nodes successfully launched to low-Earth orbit on January 11, 2026.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, compute, power and orbit (research/compute-power-orbit). The quotation (16 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 c606eab06f4866eabf24a255ea221f03fc9f219023b04f8bd04f3b52e18f1fdb; 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. A cross-family machine check (2026-10-29/30, item 75) answered the record’s question blind from fresh retrievals and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-cpo-orb-axiom-odc-launch-stated-2","claimId":"cpo-orb-axiom-odc-launch-stated","sourceId":"source-cpo-orb-axiom-odc-page","sourceRole":"primary","support":"supports","locator":"same section","passage":"Launched with the first tranche of Kepler Communications' optical relay network constellation","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, compute, power and orbit (research/compute-power-orbit). The quotation (12 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 c606eab06f4866eabf24a255ea221f03fc9f219023b04f8bd04f3b52e18f1fdb; 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. A cross-family machine check (2026-10-29/30, item 75) answered the record’s question blind from fresh retrievals and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-cpo-orb-axiom-odc-launch-stated-3","claimId":"cpo-orb-axiom-odc-launch-stated","sourceId":"source-cpo-orb-axiom-odc-2025","sourceRole":"primary","support":"context","locator":"paragraph 1","passage":"the upcoming launch of its first two Orbital Data Center (ODC) nodes to low-Earth orbit (LEO), by the end of this year","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, compute, power and orbit (research/compute-power-orbit). The quotation (22 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 417e035f07e507ced7390772ded7fec691b494bb959dd889d937568798d305f7; 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. The end-2025 target, from Axiom's release of 7 April 2025. A cross-family machine check (2026-10-29/30, item 75) answered the record’s question blind from fresh retrievals and agreed with the record. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-aib-mod-afdb-214-million-1","claimId":"aib-mod-afdb-214-million","sourceId":"source-aib-afdb-nar-2024","sourceRole":"primary","support":"supports","locator":"abstract","passage":"amassing over 214 million predicted protein structures, expanding from the initial 300k structures released in 2021","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, AI in biology (research/ai-in-biology). The quotation (16 words) matched the text retrieved for the candidate pack on 2026-10-30. Matching ignored differences of whitespace, case, quotation marks, dashes and Unicode compatibility forms, so the source’s typography can differ. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-aib-arg-p4-esm3-2024-1","claimId":"aib-arg-p4-esm3-2024","sourceId":"source-aib-esm3-release-post","sourceRole":"primary","support":"supports","locator":"Section on generating a new fluorescent protein","passage":"esmGFP, our new protein, has a sequence that is only 58% similar to the closest known fluorescent protein.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, AI in biology (research/ai-in-biology). The quotation (18 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. The company is the primary source for its own statement. A cross-family machine check (2026-10-30, item B114) re-read the record’s sources and found full support. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-aib-arg-p4-esm3-2024-2","claimId":"aib-arg-p4-esm3-2024","sourceId":"source-aib-esm3-release-post","sourceRole":"primary","support":"supports","locator":"Same section","passage":"we estimate that this generation of a new fluorescent protein is equivalent to simulating over 500 million years of evolution.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-30","note":"Candidate pack passage, AI in biology (research/ai-in-biology). The quotation (20 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. The company's own estimate, attributed. A cross-family machine check (2026-10-30, item B114) re-read the record’s sources and found full support. No human editorial review.","retrievalRoute":"direct"},{"id":"evidence-kp-states-aghion-jones-jones-2017-ai-and-economic-growth-2-1","claimId":"kp-states-aghion-jones-jones-2017-ai-and-economic-growth-2","sourceId":"source-aghion-jones-jones-2017-nber-capture","sourceRole":"primary","support":"supports","locator":"NBER Working Paper 23928, PDF p. 2, abstract","passage":"The goal throughout is to refine a set of critical questions about A.I. and economic growth and to contribute to shaping an agenda for the field.","passageType":"quote","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, key papers (research/key-papers). The quotation (26 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-lg-src-new-yogatama-dm-2019-bert-pre-training-deep-bidirectional-2019-1","claimId":"kp-cites-lg-src-new-yogatama-dm-2019-bert-pre-training-deep-bidirectional-2019","sourceId":"lg-src-new-yogatama-dm-2019","sourceRole":"primary","support":"supports","locator":"PDF p. 12, 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-weak-strong-paper-training-helpful-harmless-assistant-reinforcement-2022-1","claimId":"kp-cites-weak-strong-paper-training-helpful-harmless-assistant-reinforcement-2022","sourceId":"source-weak-strong-paper-v1","sourceRole":"primary","support":"supports","locator":"PDF p. 19, reference by arXiv identifier","passage":"The text gives the arXiv identifier 2204.05862.","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-human-preferences-paper-algorithms-inverse-reinforcement-learning-2000-1","claimId":"kp-cites-human-preferences-paper-algorithms-inverse-reinforcement-learning-2000","sourceId":"source-human-preferences-paper-v1","sourceRole":"primary","support":"supports","locator":"PDF p. 12, 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-amplification-paper-algorithms-inverse-reinforcement-learning-2000-1","claimId":"kp-cites-amplification-paper-algorithms-inverse-reinforcement-learning-2000","sourceId":"source-amplification-paper-v1","sourceRole":"primary","support":"supports","locator":"PDF p. 9, 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-miri-ml-agenda-imagenet-classification-deep-convolutional-neural-2012-1","claimId":"kp-cites-miri-ml-agenda-imagenet-classification-deep-convolutional-neural-2012","sourceId":"source-miri-ml-agenda","sourceRole":"primary","support":"supports","locator":"PDF p. 23, reference or mention by title","passage":"The text names the work by its title.","passageType":"paraphrase","verification":"machine_checked","checkedAt":"2026-10-31","note":"Candidate pack passage, key papers (research/key-papers). The citation was matched (title) in the text retrieved for the candidate pack on 2026-10-28 and re-found by its mechanical check. The paraphrase is Selekoa’s. No human editorial review."},{"id":"evidence-kp-cites-seed-coder-report-llama-2-open-foundation-fine-2023-1","claimId":"kp-cites-seed-coder-report-llama-2-open-foundation-fine-2023","sourceId":"c2-src-seed-coder-arxiv-v1-pdf","sourceRole":"primary","support":"supports","locator":"PDF p. 39, reference by arXiv identifier","passage":"The text gives the arXiv identifier 2307.09288.","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-authored-kenton-lee-deep-contextualized-word-representations-2018-1","claimId":"kp-authored-kenton-lee-deep-contextualized-word-representations-2018","sourceId":"source-kp-deep-contextualized-word-representations-2018-v1","sourceRole":"primary","support":"supports","locator":"PDF p. 1, byline","passage":"Kenton Lee","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-naman-goyal-llama-2-open-foundation-fine-2023-1","claimId":"kp-authored-naman-goyal-llama-2-open-foundation-fine-2023","sourceId":"source-kp-llama-2-open-foundation-fine-2023-v1","sourceRole":"primary","support":"supports","locator":"PDF p. 1, byline","passage":"Naman Goyal","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. A cross-family machine check (2026-10-30, item A062) transcribed the printed name from the byline blind. No human editorial review."},{"id":"evidence-kp-authored-chelsea-finn-guided-cost-learning-deep-inverse-2016-1","claimId":"kp-authored-chelsea-finn-guided-cost-learning-deep-inverse-2016","sourceId":"source-kp-guided-cost-learning-deep-inverse-2016-v1","sourceRole":"primary","support":"supports","locator":"PDF p. 1, byline","passage":"Chelsea Finn","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. A cross-family machine check (2026-10-30, item A078) transcribed the byline blind. No human editorial review."},{"id":"evidence-kp-authored-maarten-bosma-lamda-language-models-dialog-applications-2022-1","claimId":"kp-authored-maarten-bosma-lamda-language-models-dialog-applications-2022","sourceId":"source-kp-lamda-language-models-dialog-applications-2022-v1","sourceRole":"primary","support":"supports","locator":"PDF p. 1, byline","passage":"Maarten Bosma","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-rewon-child-palm-scaling-language-modeling-pathways-2022-1","claimId":"kp-authored-rewon-child-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":"Rewon Child","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. A cross-family machine check (2026-10-30, item A072) transcribed the printed name from the byline blind. No human editorial review."},{"id":"evidence-kp-authored-jeff-dean-palm-scaling-language-modeling-pathways-2022-1","claimId":"kp-authored-jeff-dean-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":"Jeff Dean","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-christian-szegedy-ssd-single-shot-multibox-detector-2015-1","claimId":"kp-authored-christian-szegedy-ssd-single-shot-multibox-detector-2015","sourceId":"source-kp-ssd-single-shot-multibox-detector-2015-v1","sourceRole":"primary","support":"supports","locator":"PDF p. 1, byline","passage":"Christian Szegedy","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-jeff-dean-distilling-knowledge-neural-network-2015-1","claimId":"kp-authored-jeff-dean-distilling-knowledge-neural-network-2015","sourceId":"source-kp-distilling-knowledge-neural-network-2015-v1","sourceRole":"primary","support":"supports","locator":"PDF p. 1, byline","passage":"Jeff Dean","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":"c3-ev-tencent-martin-lau-president","claimId":"c3-tencent-martin-lau-president","sourceId":"c3-src-tencent-ar-2025","sourceRole":"primary","support":"supports","locator":"Directors' Report, Biographical details of senior management (printed p. 65; PDF p. 66)","passage":"In 2006, Mr Lau was promoted to President of the Company to manage the day-to-day operations of the Company.","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 (19 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 (K002). A cross-family machine check (2026-10-31, item K002) 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-martin-lau-president-2","claimId":"c3-tencent-martin-lau-president","sourceId":"c3-src-tencent-ar-2025","sourceRole":"primary","support":"supports","locator":"Directors' Report, Biographical details of senior management (printed p. 65; PDF p. 66)","passage":"Lau Chi Ping Martin … President, joined the Company in 2005 as the Chief Strategy and Investment Officer","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 (17 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. Elided quotation: the ellipses mark omitted words, so the passage is not continuous in the source. Locator corrected at admission (K002.). A cross-family machine check (2026-10-31, item K002) 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-a13b-licence-licensor","claimId":"c3-tencent-a13b-licence-licensor","sourceId":"c3-src-hunyuan-a13b-hf-license","sourceRole":"primary","support":"supports","locator":"Section 1(i)","passage":"“Tencent,” “We” or “Us” shall mean the applicable entity or entities in the Tencent corporate family that own(s) intellectual property or other rights embodied in or utilized by the Materials.","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 (30 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 K072) re-read the record’s sources directly and found full support. No human editorial review.","retrievalRoute":"direct"},{"id":"c3-ev-tencent-a13b-licence-licensor-video","claimId":"c3-tencent-a13b-licence-licensor","sourceId":"c3-src-hunyuanvideo-hf-license","sourceRole":"primary","support":"context","locator":"Section 1(i)","passage":"“Tencent,” “We” or “Us” shall mean THL A29 Limited.","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 (9 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 K072) re-read the record’s sources directly and found full support. No human editorial review.","retrievalRoute":"direct"}],"at":{"entities":[0,2,10,15,21,22,24,38,39,42,43,44,45,46,47,48,49,50,51,52,53,54,56,57,67,92,99,103,105,146,187,199,200,201,202,205,207,248,318,338,371,383,503,520,527,537,552,586,604,644,646,661,727,741,798,806,809,884,891,936,975,981,988,995,1135,1136,1293,1329,1344,1441,1445,1450,1463,1466,1469,1470,1471,1490,1494,1497,1516,1524,1536,1543,1550,1669,1732],"claims":[67,140,481,616,791,1139,1240,1441,1516,1600,1752,1769,1771,1959,1982,2103,2111,2253,2280,2574,2636,2674,2719,2761,2766,2772,2816,2859,3226,3624,3736,3759,3981,4164,4187,4188,4222,4227,4576,4580,4618,4633,4654,4657,4685,4692,4913,5022],"sources":[0,11,42,45,46,48,51,92,98,102,104,121,178,184,191,323,350,472,478,488,505,553,582,590,592,671,678,686,700,736,778,787,804,807,819,931,997,1185,1192,1303,1308,1352,1361,1370,1424,1447,1576,1633,1642],"evidence":[70,159,512,717,1001,1382,1551,1792,1890,2003,2004,2249,2250,2276,2278,2532,2560,2724,2737,2900,2927,3232,3310,3355,3415,3487,3488,3497,3498,3507,3508,3590,3591,3662,4414,4415,4416,5011,5185,5186,5217,5439,5622,5645,5646,5680,5685,6034,6038,6076,6091,6112,6115,6143,6150,6439,6440,6630,6631]},"version":"131evrz"}